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/bitvector/s3_srvr_3.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:32,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:32,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:32,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:32,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:32,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:32,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:32,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:32,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:32,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:32,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:32,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:32,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:32,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:32,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:32,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:32,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:32,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:32,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:32,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:32,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:32,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:32,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:32,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:32,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:32,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:32,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:32,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:32,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:32,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:32,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:32,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:32,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:32,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:32,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:32,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:32,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:32,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:32,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:32,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:32,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:32,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:44:32,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:32,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:32,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:32,718 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:32,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:32,719 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:32,720 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:32,720 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:32,720 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:32,720 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:32,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:32,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:32,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:32,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:32,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:32,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:32,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:32,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:32,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:32,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:32,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:32,725 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:32,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:32,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:32,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:32,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:32,726 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:32,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:32,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:32,727 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:32,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:32,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:32,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:32,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:32,804 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:32,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3.BV.c.cil.c [2019-09-09 05:44:32,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7fbfce9/8cc989d0d42844b38e8b87d9fc499009/FLAGe47513efa [2019-09-09 05:44:33,433 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:33,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3.BV.c.cil.c [2019-09-09 05:44:33,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7fbfce9/8cc989d0d42844b38e8b87d9fc499009/FLAGe47513efa [2019-09-09 05:44:33,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7fbfce9/8cc989d0d42844b38e8b87d9fc499009 [2019-09-09 05:44:33,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:33,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:33,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:33,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:33,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:33,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:33" (1/1) ... [2019-09-09 05:44:33,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d1a98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:33, skipping insertion in model container [2019-09-09 05:44:33,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:33" (1/1) ... [2019-09-09 05:44:33,786 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:33,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:34,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:34,244 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:34,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:34,333 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:34,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34 WrapperNode [2019-09-09 05:44:34,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:34,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:34,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:34,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:34,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... [2019-09-09 05:44:34,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:34,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:34,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:34,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:34,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:44:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:44:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:44:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:44:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:34,719 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:44:35,234 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:44:35,234 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:44:35,237 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:35,237 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:44:35,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:35 BoogieIcfgContainer [2019-09-09 05:44:35,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:35,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:35,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:35,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:35,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:33" (1/3) ... [2019-09-09 05:44:35,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5e9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:35, skipping insertion in model container [2019-09-09 05:44:35,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:34" (2/3) ... [2019-09-09 05:44:35,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e5e9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:35, skipping insertion in model container [2019-09-09 05:44:35,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:35" (3/3) ... [2019-09-09 05:44:35,248 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c [2019-09-09 05:44:35,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:35,272 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:35,291 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:35,326 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:35,326 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:35,326 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:35,327 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:35,327 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:35,327 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:35,327 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:35,328 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-09-09 05:44:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:44:35,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:35,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:35,389 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash -459257302, now seen corresponding path program 1 times [2019-09-09 05:44:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:35,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:35,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:35,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:35,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:35,737 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2019-09-09 05:44:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:36,234 INFO L93 Difference]: Finished difference Result 199 states and 335 transitions. [2019-09-09 05:44:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:36,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:44:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:36,266 INFO L225 Difference]: With dead ends: 199 [2019-09-09 05:44:36,267 INFO L226 Difference]: Without dead ends: 176 [2019-09-09 05:44:36,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-09 05:44:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2019-09-09 05:44:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-09 05:44:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-09-09 05:44:36,367 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 49 [2019-09-09 05:44:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:36,370 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-09-09 05:44:36,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-09-09 05:44:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:44:36,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:36,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:36,379 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1359139796, now seen corresponding path program 1 times [2019-09-09 05:44:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:36,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:36,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:36,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:36,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:36,547 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 5 states. [2019-09-09 05:44:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:36,871 INFO L93 Difference]: Finished difference Result 219 states and 361 transitions. [2019-09-09 05:44:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:36,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:44:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:36,876 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:44:36,876 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:44:36,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:44:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2019-09-09 05:44:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-09 05:44:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2019-09-09 05:44:36,891 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 50 [2019-09-09 05:44:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:36,892 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2019-09-09 05:44:36,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2019-09-09 05:44:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:44:36,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:36,896 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:36,896 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash -250817147, now seen corresponding path program 1 times [2019-09-09 05:44:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:36,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:36,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:36,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:36,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:37,000 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand 5 states. [2019-09-09 05:44:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:37,285 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2019-09-09 05:44:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:37,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-09 05:44:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:37,288 INFO L225 Difference]: With dead ends: 243 [2019-09-09 05:44:37,288 INFO L226 Difference]: Without dead ends: 243 [2019-09-09 05:44:37,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-09 05:44:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-09-09 05:44:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-09 05:44:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 409 transitions. [2019-09-09 05:44:37,304 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 409 transitions. Word has length 77 [2019-09-09 05:44:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:37,306 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 409 transitions. [2019-09-09 05:44:37,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 409 transitions. [2019-09-09 05:44:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:37,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:37,316 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:37,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -508376229, now seen corresponding path program 1 times [2019-09-09 05:44:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:37,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:37,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:37,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:37,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:37,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:37,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:37,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:37,429 INFO L87 Difference]: Start difference. First operand 243 states and 409 transitions. Second operand 5 states. [2019-09-09 05:44:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:37,647 INFO L93 Difference]: Finished difference Result 260 states and 434 transitions. [2019-09-09 05:44:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:37,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:44:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:37,651 INFO L225 Difference]: With dead ends: 260 [2019-09-09 05:44:37,651 INFO L226 Difference]: Without dead ends: 260 [2019-09-09 05:44:37,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-09 05:44:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-09-09 05:44:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:44:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 432 transitions. [2019-09-09 05:44:37,662 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 432 transitions. Word has length 89 [2019-09-09 05:44:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:37,662 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 432 transitions. [2019-09-09 05:44:37,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 432 transitions. [2019-09-09 05:44:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:37,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:37,665 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:37,665 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:37,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash 384668356, now seen corresponding path program 1 times [2019-09-09 05:44:37,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:37,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:37,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:37,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:37,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:37,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:37,750 INFO L87 Difference]: Start difference. First operand 258 states and 432 transitions. Second operand 5 states. [2019-09-09 05:44:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:38,024 INFO L93 Difference]: Finished difference Result 304 states and 511 transitions. [2019-09-09 05:44:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:38,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:44:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:38,027 INFO L225 Difference]: With dead ends: 304 [2019-09-09 05:44:38,027 INFO L226 Difference]: Without dead ends: 304 [2019-09-09 05:44:38,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-09 05:44:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2019-09-09 05:44:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 506 transitions. [2019-09-09 05:44:38,036 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 506 transitions. Word has length 89 [2019-09-09 05:44:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:38,036 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 506 transitions. [2019-09-09 05:44:38,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 506 transitions. [2019-09-09 05:44:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:38,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:38,038 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:38,038 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1150340194, now seen corresponding path program 1 times [2019-09-09 05:44:38,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:38,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:38,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:38,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:38,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:38,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:38,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:38,100 INFO L87 Difference]: Start difference. First operand 300 states and 506 transitions. Second operand 5 states. [2019-09-09 05:44:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:38,306 INFO L93 Difference]: Finished difference Result 302 states and 504 transitions. [2019-09-09 05:44:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:38,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:38,309 INFO L225 Difference]: With dead ends: 302 [2019-09-09 05:44:38,309 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:44:38,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:44:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-09-09 05:44:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 502 transitions. [2019-09-09 05:44:38,318 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 502 transitions. Word has length 90 [2019-09-09 05:44:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:38,319 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 502 transitions. [2019-09-09 05:44:38,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 502 transitions. [2019-09-09 05:44:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:38,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:38,321 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:38,321 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 12513126, now seen corresponding path program 1 times [2019-09-09 05:44:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:38,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:38,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:38,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:38,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:38,391 INFO L87 Difference]: Start difference. First operand 300 states and 502 transitions. Second operand 5 states. [2019-09-09 05:44:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:38,629 INFO L93 Difference]: Finished difference Result 304 states and 505 transitions. [2019-09-09 05:44:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:38,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:38,634 INFO L225 Difference]: With dead ends: 304 [2019-09-09 05:44:38,634 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:44:38,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:44:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-09-09 05:44:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-09 05:44:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 497 transitions. [2019-09-09 05:44:38,643 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 497 transitions. Word has length 90 [2019-09-09 05:44:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:38,643 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 497 transitions. [2019-09-09 05:44:38,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 497 transitions. [2019-09-09 05:44:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:44:38,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:38,645 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:38,645 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1256654058, now seen corresponding path program 1 times [2019-09-09 05:44:38,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:44:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:38,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:38,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:38,707 INFO L87 Difference]: Start difference. First operand 298 states and 497 transitions. Second operand 5 states. [2019-09-09 05:44:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:38,869 INFO L93 Difference]: Finished difference Result 306 states and 502 transitions. [2019-09-09 05:44:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:38,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-09 05:44:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:38,871 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:44:38,871 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:44:38,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:44:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-09 05:44:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-09 05:44:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-09 05:44:38,880 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 101 [2019-09-09 05:44:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:38,880 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-09 05:44:38,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-09 05:44:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:44:38,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:38,882 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:38,882 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -315055682, now seen corresponding path program 1 times [2019-09-09 05:44:38,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:38,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:38,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:38,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:38,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:38,946 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 5 states. [2019-09-09 05:44:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:39,150 INFO L93 Difference]: Finished difference Result 337 states and 551 transitions. [2019-09-09 05:44:39,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:39,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:44:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:39,153 INFO L225 Difference]: With dead ends: 337 [2019-09-09 05:44:39,154 INFO L226 Difference]: Without dead ends: 337 [2019-09-09 05:44:39,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-09 05:44:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2019-09-09 05:44:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-09 05:44:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2019-09-09 05:44:39,164 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 103 [2019-09-09 05:44:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:39,164 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2019-09-09 05:44:39,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2019-09-09 05:44:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:44:39,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:39,167 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:39,167 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1874973505, now seen corresponding path program 1 times [2019-09-09 05:44:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:39,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:39,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:39,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:39,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:39,237 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 5 states. [2019-09-09 05:44:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:39,456 INFO L93 Difference]: Finished difference Result 369 states and 603 transitions. [2019-09-09 05:44:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:39,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:44:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:39,460 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:44:39,461 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:44:39,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:44:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-09 05:44:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 591 transitions. [2019-09-09 05:44:39,477 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 591 transitions. Word has length 104 [2019-09-09 05:44:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:39,477 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 591 transitions. [2019-09-09 05:44:39,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 591 transitions. [2019-09-09 05:44:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:44:39,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:39,480 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:39,480 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash -411681051, now seen corresponding path program 1 times [2019-09-09 05:44:39,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:39,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:39,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:39,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:39,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:39,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:39,551 INFO L87 Difference]: Start difference. First operand 362 states and 591 transitions. Second operand 5 states. [2019-09-09 05:44:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:39,757 INFO L93 Difference]: Finished difference Result 364 states and 589 transitions. [2019-09-09 05:44:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:39,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:44:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:39,760 INFO L225 Difference]: With dead ends: 364 [2019-09-09 05:44:39,761 INFO L226 Difference]: Without dead ends: 364 [2019-09-09 05:44:39,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-09 05:44:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-09-09 05:44:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2019-09-09 05:44:39,775 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 104 [2019-09-09 05:44:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:39,775 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2019-09-09 05:44:39,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2019-09-09 05:44:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:44:39,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:39,778 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:39,779 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1317457818, now seen corresponding path program 1 times [2019-09-09 05:44:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:39,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:39,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:39,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:39,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:39,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:39,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:39,843 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 5 states. [2019-09-09 05:44:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:40,084 INFO L93 Difference]: Finished difference Result 369 states and 594 transitions. [2019-09-09 05:44:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:40,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:44:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:40,087 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:44:40,088 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:44:40,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:44:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-09 05:44:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2019-09-09 05:44:40,099 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 105 [2019-09-09 05:44:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:40,100 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2019-09-09 05:44:40,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2019-09-09 05:44:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:44:40,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:40,102 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:40,102 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -817214863, now seen corresponding path program 1 times [2019-09-09 05:44:40,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:40,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:40,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:40,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:40,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:40,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:40,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:40,163 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 5 states. [2019-09-09 05:44:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:40,416 INFO L93 Difference]: Finished difference Result 387 states and 617 transitions. [2019-09-09 05:44:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:40,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:44:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:40,419 INFO L225 Difference]: With dead ends: 387 [2019-09-09 05:44:40,419 INFO L226 Difference]: Without dead ends: 387 [2019-09-09 05:44:40,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-09 05:44:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-09 05:44:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-09 05:44:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2019-09-09 05:44:40,430 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 110 [2019-09-09 05:44:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:40,430 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2019-09-09 05:44:40,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2019-09-09 05:44:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:44:40,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:40,432 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:40,432 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1429215766, now seen corresponding path program 1 times [2019-09-09 05:44:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:40,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:40,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:40,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:40,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:40,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:40,554 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 5 states. [2019-09-09 05:44:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:40,884 INFO L93 Difference]: Finished difference Result 387 states and 611 transitions. [2019-09-09 05:44:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:40,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:44:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:40,888 INFO L225 Difference]: With dead ends: 387 [2019-09-09 05:44:40,888 INFO L226 Difference]: Without dead ends: 387 [2019-09-09 05:44:40,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-09 05:44:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-09 05:44:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-09 05:44:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2019-09-09 05:44:40,905 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 111 [2019-09-09 05:44:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:40,906 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2019-09-09 05:44:40,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2019-09-09 05:44:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:44:40,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:40,910 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:40,910 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1449286990, now seen corresponding path program 1 times [2019-09-09 05:44:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:40,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:44:40,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:40,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:40,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:40,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:40,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:40,979 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2019-09-09 05:44:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:41,026 INFO L93 Difference]: Finished difference Result 751 states and 1191 transitions. [2019-09-09 05:44:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:41,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:44:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:41,032 INFO L225 Difference]: With dead ends: 751 [2019-09-09 05:44:41,032 INFO L226 Difference]: Without dead ends: 751 [2019-09-09 05:44:41,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-09 05:44:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-09-09 05:44:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-09 05:44:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1191 transitions. [2019-09-09 05:44:41,052 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1191 transitions. Word has length 126 [2019-09-09 05:44:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:41,053 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1191 transitions. [2019-09-09 05:44:41,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1191 transitions. [2019-09-09 05:44:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:44:41,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:41,056 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:41,057 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1360581389, now seen corresponding path program 1 times [2019-09-09 05:44:41,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:41,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:41,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:41,070 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:41,071 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:41,071 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:41,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:41,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:41,139 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-09 05:44:41,142 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [93], [98], [103], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:41,200 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:41,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:41,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:41,451 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 93 root evaluator evaluations with a maximum evaluation depth of 4. Performed 93 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 84 variables. [2019-09-09 05:44:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:41,456 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:41,620 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 84.85% of their original sizes. [2019-09-09 05:44:41,620 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:41,731 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-09 05:44:41,731 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:41,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-09 05:44:41,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:41,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:44:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:44:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:44:41,734 INFO L87 Difference]: Start difference. First operand 751 states and 1191 transitions. Second operand 10 states. [2019-09-09 05:44:42,470 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:42,753 INFO L93 Difference]: Finished difference Result 764 states and 1204 transitions. [2019-09-09 05:44:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:44:42,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-09 05:44:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:42,759 INFO L225 Difference]: With dead ends: 764 [2019-09-09 05:44:42,759 INFO L226 Difference]: Without dead ends: 764 [2019-09-09 05:44:42,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:44:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-09 05:44:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-09-09 05:44:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-09 05:44:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1204 transitions. [2019-09-09 05:44:42,785 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1204 transitions. Word has length 127 [2019-09-09 05:44:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:42,785 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1204 transitions. [2019-09-09 05:44:42,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:44:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1204 transitions. [2019-09-09 05:44:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:44:42,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:42,791 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-09 05:44:42,791 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1941520082, now seen corresponding path program 1 times [2019-09-09 05:44:42,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:42,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-09 05:44:42,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:42,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:42,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:42,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:42,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:42,855 INFO L87 Difference]: Start difference. First operand 764 states and 1204 transitions. Second operand 3 states. [2019-09-09 05:44:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:43,039 INFO L93 Difference]: Finished difference Result 772 states and 1198 transitions. [2019-09-09 05:44:43,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:43,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-09 05:44:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:43,063 INFO L225 Difference]: With dead ends: 772 [2019-09-09 05:44:43,063 INFO L226 Difference]: Without dead ends: 772 [2019-09-09 05:44:43,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-09 05:44:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2019-09-09 05:44:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-09 05:44:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1186 transitions. [2019-09-09 05:44:43,083 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1186 transitions. Word has length 143 [2019-09-09 05:44:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:43,083 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1186 transitions. [2019-09-09 05:44:43,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1186 transitions. [2019-09-09 05:44:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:44:43,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:43,086 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:43,087 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1426466207, now seen corresponding path program 1 times [2019-09-09 05:44:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:43,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:43,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:43,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:43,097 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:43,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:43,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:43,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2019-09-09 05:44:43,153 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:43,156 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:43,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:43,280 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:43,281 INFO L272 AbstractInterpreter]: Visited 63 different actions 121 times. Merged at 41 different actions 53 times. Never widened. Performed 298 root evaluator evaluations with a maximum evaluation depth of 4. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 86 variables. [2019-09-09 05:44:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:43,282 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:43,532 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 87.36% of their original sizes. [2019-09-09 05:44:43,533 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:46,014 INFO L420 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2019-09-09 05:44:46,014 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:46,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:46,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-09-09 05:44:46,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:46,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-09 05:44:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-09 05:44:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1471, Unknown=0, NotChecked=0, Total=1806 [2019-09-09 05:44:46,018 INFO L87 Difference]: Start difference. First operand 764 states and 1186 transitions. Second operand 43 states. [2019-09-09 05:44:53,902 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:58,005 INFO L93 Difference]: Finished difference Result 1254 states and 1855 transitions. [2019-09-09 05:44:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-09 05:44:58,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-09 05:44:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:58,012 INFO L225 Difference]: With dead ends: 1254 [2019-09-09 05:44:58,012 INFO L226 Difference]: Without dead ends: 1254 [2019-09-09 05:44:58,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=564, Invalid=2192, Unknown=0, NotChecked=0, Total=2756 [2019-09-09 05:44:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-09-09 05:44:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1137. [2019-09-09 05:44:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2019-09-09 05:44:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1729 transitions. [2019-09-09 05:44:58,038 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1729 transitions. Word has length 164 [2019-09-09 05:44:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:58,039 INFO L475 AbstractCegarLoop]: Abstraction has 1137 states and 1729 transitions. [2019-09-09 05:44:58,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-09 05:44:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1729 transitions. [2019-09-09 05:44:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:44:58,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:58,043 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:58,044 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1194093563, now seen corresponding path program 1 times [2019-09-09 05:44:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:58,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:58,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:58,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:58,055 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:58,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:58,056 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) [2019-09-09 05:44:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:58,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Exception during sending of exit command (exit): Stream closed [2019-09-09 05:44:58,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-09-09 05:44:58,112 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [13], [16], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:58,125 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:58,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:58,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:58,206 INFO L272 AbstractInterpreter]: Visited 64 different actions 122 times. Merged at 41 different actions 53 times. Never widened. Performed 299 root evaluator evaluations with a maximum evaluation depth of 4. Performed 299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 86 variables. [2019-09-09 05:44:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:58,206 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:58,419 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 86.73% of their original sizes. [2019-09-09 05:44:58,419 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:00,877 INFO L420 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2019-09-09 05:45:00,877 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:00,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:00,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2019-09-09 05:45:00,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:00,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-09 05:45:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-09 05:45:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2019-09-09 05:45:00,880 INFO L87 Difference]: Start difference. First operand 1137 states and 1729 transitions. Second operand 45 states. [2019-09-09 05:45:08,251 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:13,704 INFO L93 Difference]: Finished difference Result 2072 states and 3020 transitions. [2019-09-09 05:45:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-09 05:45:13,704 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2019-09-09 05:45:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:13,714 INFO L225 Difference]: With dead ends: 2072 [2019-09-09 05:45:13,714 INFO L226 Difference]: Without dead ends: 2072 [2019-09-09 05:45:13,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=556, Invalid=2306, Unknown=0, NotChecked=0, Total=2862 [2019-09-09 05:45:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-09-09 05:45:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1161. [2019-09-09 05:45:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-09 05:45:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1757 transitions. [2019-09-09 05:45:13,745 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1757 transitions. Word has length 165 [2019-09-09 05:45:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:13,745 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1757 transitions. [2019-09-09 05:45:13,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-09 05:45:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1757 transitions. [2019-09-09 05:45:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:45:13,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:13,750 INFO L399 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:13,750 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash -391989381, now seen corresponding path program 1 times [2019-09-09 05:45:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:13,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:45:13,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:13,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:13,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:13,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:13,817 INFO L87 Difference]: Start difference. First operand 1161 states and 1757 transitions. Second operand 3 states. [2019-09-09 05:45:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:13,989 INFO L93 Difference]: Finished difference Result 1188 states and 1754 transitions. [2019-09-09 05:45:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:13,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:45:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:13,996 INFO L225 Difference]: With dead ends: 1188 [2019-09-09 05:45:13,996 INFO L226 Difference]: Without dead ends: 1188 [2019-09-09 05:45:13,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-09-09 05:45:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1161. [2019-09-09 05:45:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-09 05:45:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1721 transitions. [2019-09-09 05:45:14,019 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1721 transitions. Word has length 204 [2019-09-09 05:45:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:14,019 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1721 transitions. [2019-09-09 05:45:14,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1721 transitions. [2019-09-09 05:45:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-09 05:45:14,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:14,024 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:14,025 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -945704107, now seen corresponding path program 1 times [2019-09-09 05:45:14,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:14,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-09 05:45:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:14,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:14,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:14,081 INFO L87 Difference]: Start difference. First operand 1161 states and 1721 transitions. Second operand 3 states. [2019-09-09 05:45:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:14,280 INFO L93 Difference]: Finished difference Result 1199 states and 1727 transitions. [2019-09-09 05:45:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:14,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-09 05:45:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:14,288 INFO L225 Difference]: With dead ends: 1199 [2019-09-09 05:45:14,288 INFO L226 Difference]: Without dead ends: 1199 [2019-09-09 05:45:14,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-09 05:45:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1161. [2019-09-09 05:45:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-09 05:45:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1683 transitions. [2019-09-09 05:45:14,311 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1683 transitions. Word has length 217 [2019-09-09 05:45:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:14,312 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1683 transitions. [2019-09-09 05:45:14,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1683 transitions. [2019-09-09 05:45:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-09 05:45:14,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:14,318 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:14,319 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1110401752, now seen corresponding path program 1 times [2019-09-09 05:45:14,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:14,348 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:14,349 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:14,349 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) [2019-09-09 05:45:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-09-09 05:45:14,408 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:45:14,410 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:14,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:14,559 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:14,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:14,667 INFO L272 AbstractInterpreter]: Visited 78 different actions 421 times. Merged at 67 different actions 314 times. Widened at 7 different actions 12 times. Performed 975 root evaluator evaluations with a maximum evaluation depth of 8. Performed 975 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 29 fixpoints after 13 different actions. Largest state had 86 variables. [2019-09-09 05:45:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:14,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:14,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:14,668 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) [2019-09-09 05:45:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:14,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:14,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:14,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-09 05:45:14,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-09 05:45:15,069 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:45:15,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:15,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:15,072 INFO L87 Difference]: Start difference. First operand 1161 states and 1683 transitions. Second operand 3 states. [2019-09-09 05:45:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:15,108 INFO L93 Difference]: Finished difference Result 2211 states and 3228 transitions. [2019-09-09 05:45:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:15,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-09 05:45:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:15,123 INFO L225 Difference]: With dead ends: 2211 [2019-09-09 05:45:15,123 INFO L226 Difference]: Without dead ends: 2211 [2019-09-09 05:45:15,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-09 05:45:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2209. [2019-09-09 05:45:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2019-09-09 05:45:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3227 transitions. [2019-09-09 05:45:15,186 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3227 transitions. Word has length 246 [2019-09-09 05:45:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:15,187 INFO L475 AbstractCegarLoop]: Abstraction has 2209 states and 3227 transitions. [2019-09-09 05:45:15,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3227 transitions. [2019-09-09 05:45:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-09 05:45:15,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:15,201 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:15,201 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1423055184, now seen corresponding path program 1 times [2019-09-09 05:45:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:15,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:15,229 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:15,229 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:15,229 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:15,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:45:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:15,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2019-09-09 05:45:15,343 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:45:15,347 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:15,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:15,553 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:15,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:15,758 INFO L272 AbstractInterpreter]: Visited 80 different actions 532 times. Merged at 68 different actions 404 times. Widened at 9 different actions 20 times. Performed 1307 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 49 fixpoints after 16 different actions. Largest state had 86 variables. [2019-09-09 05:45:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:15,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:15,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:15,759 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-09-09 05:45:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:15,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:15,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-09 05:45:15,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-09 05:45:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:45:16,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:16,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:16,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:16,007 INFO L87 Difference]: Start difference. First operand 2209 states and 3227 transitions. Second operand 3 states. [2019-09-09 05:45:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:16,159 INFO L93 Difference]: Finished difference Result 2209 states and 3161 transitions. [2019-09-09 05:45:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:16,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-09 05:45:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:16,170 INFO L225 Difference]: With dead ends: 2209 [2019-09-09 05:45:16,170 INFO L226 Difference]: Without dead ends: 2209 [2019-09-09 05:45:16,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2019-09-09 05:45:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2209. [2019-09-09 05:45:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2019-09-09 05:45:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3161 transitions. [2019-09-09 05:45:16,220 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3161 transitions. Word has length 283 [2019-09-09 05:45:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:16,220 INFO L475 AbstractCegarLoop]: Abstraction has 2209 states and 3161 transitions. [2019-09-09 05:45:16,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3161 transitions. [2019-09-09 05:45:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-09 05:45:16,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:16,229 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:16,229 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash 464693141, now seen corresponding path program 1 times [2019-09-09 05:45:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:16,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:16,247 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:16,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:16,247 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:16,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:45:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,322 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2019-09-09 05:45:16,323 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [436], [438], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:45:16,332 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:16,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:16,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:16,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:16,584 INFO L272 AbstractInterpreter]: Visited 83 different actions 557 times. Merged at 71 different actions 421 times. Widened at 9 different actions 22 times. Performed 1338 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1338 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 50 fixpoints after 17 different actions. Largest state had 86 variables. [2019-09-09 05:45:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:16,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:16,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:16,584 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:16,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:16,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:16,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:45:16,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:45:16,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:45:16,847 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:16,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-09-09 05:45:16,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:16,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:16,848 INFO L87 Difference]: Start difference. First operand 2209 states and 3161 transitions. Second operand 3 states. [2019-09-09 05:45:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:17,018 INFO L93 Difference]: Finished difference Result 2443 states and 3419 transitions. [2019-09-09 05:45:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:17,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-09 05:45:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:17,026 INFO L225 Difference]: With dead ends: 2443 [2019-09-09 05:45:17,027 INFO L226 Difference]: Without dead ends: 1504 [2019-09-09 05:45:17,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-09-09 05:45:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1461. [2019-09-09 05:45:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-09-09 05:45:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2068 transitions. [2019-09-09 05:45:17,052 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2068 transitions. Word has length 311 [2019-09-09 05:45:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:17,052 INFO L475 AbstractCegarLoop]: Abstraction has 1461 states and 2068 transitions. [2019-09-09 05:45:17,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2068 transitions. [2019-09-09 05:45:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-09 05:45:17,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:17,060 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:17,060 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:17,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:17,061 INFO L82 PathProgramCache]: Analyzing trace with hash -60637526, now seen corresponding path program 1 times [2019-09-09 05:45:17,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:17,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:17,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-09 05:45:17,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:17,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:17,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:17,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:17,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,177 INFO L87 Difference]: Start difference. First operand 1461 states and 2068 transitions. Second operand 3 states. [2019-09-09 05:45:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:17,320 INFO L93 Difference]: Finished difference Result 1542 states and 2168 transitions. [2019-09-09 05:45:17,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:17,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-09 05:45:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:17,328 INFO L225 Difference]: With dead ends: 1542 [2019-09-09 05:45:17,328 INFO L226 Difference]: Without dead ends: 1542 [2019-09-09 05:45:17,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-09 05:45:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1530. [2019-09-09 05:45:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-09-09 05:45:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2152 transitions. [2019-09-09 05:45:17,355 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2152 transitions. Word has length 312 [2019-09-09 05:45:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:17,356 INFO L475 AbstractCegarLoop]: Abstraction has 1530 states and 2152 transitions. [2019-09-09 05:45:17,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2152 transitions. [2019-09-09 05:45:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-09 05:45:17,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:17,363 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:17,364 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1485741080, now seen corresponding path program 1 times [2019-09-09 05:45:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-09 05:45:17,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:17,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:17,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:17,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:17,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:17,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,488 INFO L87 Difference]: Start difference. First operand 1530 states and 2152 transitions. Second operand 3 states. [2019-09-09 05:45:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:17,615 INFO L93 Difference]: Finished difference Result 1678 states and 2352 transitions. [2019-09-09 05:45:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:17,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-09 05:45:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:17,623 INFO L225 Difference]: With dead ends: 1678 [2019-09-09 05:45:17,625 INFO L226 Difference]: Without dead ends: 1678 [2019-09-09 05:45:17,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-09-09 05:45:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1630. [2019-09-09 05:45:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-09-09 05:45:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2272 transitions. [2019-09-09 05:45:17,660 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2272 transitions. Word has length 332 [2019-09-09 05:45:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:17,660 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2272 transitions. [2019-09-09 05:45:17,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2272 transitions. [2019-09-09 05:45:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-09 05:45:17,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:17,668 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:17,668 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:17,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash 432297452, now seen corresponding path program 1 times [2019-09-09 05:45:17,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:17,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-09-09 05:45:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:17,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:17,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:17,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:17,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,824 INFO L87 Difference]: Start difference. First operand 1630 states and 2272 transitions. Second operand 3 states. [2019-09-09 05:45:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:17,959 INFO L93 Difference]: Finished difference Result 1658 states and 2280 transitions. [2019-09-09 05:45:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:17,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-09-09 05:45:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:17,966 INFO L225 Difference]: With dead ends: 1658 [2019-09-09 05:45:17,966 INFO L226 Difference]: Without dead ends: 1658 [2019-09-09 05:45:17,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-09-09 05:45:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1630. [2019-09-09 05:45:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-09-09 05:45:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2232 transitions. [2019-09-09 05:45:17,994 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2232 transitions. Word has length 358 [2019-09-09 05:45:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:17,994 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2232 transitions. [2019-09-09 05:45:17,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2232 transitions. [2019-09-09 05:45:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-09 05:45:17,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:17,999 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:17,999 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:18,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash 222053756, now seen corresponding path program 1 times [2019-09-09 05:45:18,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:18,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:18,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:18,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:18,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:18,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:18,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2019-09-09 05:45:18,164 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:45:18,168 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:18,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:18,200 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:18,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:18,505 INFO L272 AbstractInterpreter]: Visited 97 different actions 864 times. Merged at 78 different actions 670 times. Widened at 16 different actions 64 times. Performed 1928 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1928 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 74 fixpoints after 16 different actions. Largest state had 88 variables. [2019-09-09 05:45:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:18,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:18,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:18,505 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:18,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:18,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:18,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:18,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:18,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:18,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:18,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:45:18,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:18,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:18,842 INFO L87 Difference]: Start difference. First operand 1630 states and 2232 transitions. Second operand 4 states. [2019-09-09 05:45:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:19,199 INFO L93 Difference]: Finished difference Result 2485 states and 3307 transitions. [2019-09-09 05:45:19,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:19,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-09-09 05:45:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:19,210 INFO L225 Difference]: With dead ends: 2485 [2019-09-09 05:45:19,210 INFO L226 Difference]: Without dead ends: 2403 [2019-09-09 05:45:19,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:45:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-09-09 05:45:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1710. [2019-09-09 05:45:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-09-09 05:45:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2322 transitions. [2019-09-09 05:45:19,237 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2322 transitions. Word has length 375 [2019-09-09 05:45:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:19,237 INFO L475 AbstractCegarLoop]: Abstraction has 1710 states and 2322 transitions. [2019-09-09 05:45:19,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2322 transitions. [2019-09-09 05:45:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-09 05:45:19,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:19,242 INFO L399 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, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:19,242 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1893965958, now seen corresponding path program 1 times [2019-09-09 05:45:19,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-09-09 05:45:19,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:19,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:19,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:19,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:19,391 INFO L87 Difference]: Start difference. First operand 1710 states and 2322 transitions. Second operand 3 states. [2019-09-09 05:45:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:19,574 INFO L93 Difference]: Finished difference Result 1718 states and 2290 transitions. [2019-09-09 05:45:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-09-09 05:45:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:19,582 INFO L225 Difference]: With dead ends: 1718 [2019-09-09 05:45:19,583 INFO L226 Difference]: Without dead ends: 1718 [2019-09-09 05:45:19,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-09-09 05:45:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1710. [2019-09-09 05:45:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-09-09 05:45:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2282 transitions. [2019-09-09 05:45:19,617 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2282 transitions. Word has length 443 [2019-09-09 05:45:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:19,617 INFO L475 AbstractCegarLoop]: Abstraction has 1710 states and 2282 transitions. [2019-09-09 05:45:19,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2282 transitions. [2019-09-09 05:45:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-09 05:45:19,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:19,627 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:19,627 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 756608049, now seen corresponding path program 1 times [2019-09-09 05:45:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:19,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-09-09 05:45:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:19,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:19,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:19,910 INFO L87 Difference]: Start difference. First operand 1710 states and 2282 transitions. Second operand 3 states. [2019-09-09 05:45:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:20,089 INFO L93 Difference]: Finished difference Result 1854 states and 2446 transitions. [2019-09-09 05:45:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:20,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-09 05:45:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:20,094 INFO L225 Difference]: With dead ends: 1854 [2019-09-09 05:45:20,094 INFO L226 Difference]: Without dead ends: 1854 [2019-09-09 05:45:20,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-09-09 05:45:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1846. [2019-09-09 05:45:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2019-09-09 05:45:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2438 transitions. [2019-09-09 05:45:20,121 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2438 transitions. Word has length 475 [2019-09-09 05:45:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:20,122 INFO L475 AbstractCegarLoop]: Abstraction has 1846 states and 2438 transitions. [2019-09-09 05:45:20,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2438 transitions. [2019-09-09 05:45:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-09-09 05:45:20,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:20,128 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:20,129 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -10886553, now seen corresponding path program 1 times [2019-09-09 05:45:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-09-09 05:45:20,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:20,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:20,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:20,362 INFO L87 Difference]: Start difference. First operand 1846 states and 2438 transitions. Second operand 3 states. [2019-09-09 05:45:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:20,533 INFO L93 Difference]: Finished difference Result 1998 states and 2610 transitions. [2019-09-09 05:45:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:20,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-09-09 05:45:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:20,541 INFO L225 Difference]: With dead ends: 1998 [2019-09-09 05:45:20,541 INFO L226 Difference]: Without dead ends: 1998 [2019-09-09 05:45:20,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-09-09 05:45:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1990. [2019-09-09 05:45:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2019-09-09 05:45:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2602 transitions. [2019-09-09 05:45:20,576 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2602 transitions. Word has length 537 [2019-09-09 05:45:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:20,577 INFO L475 AbstractCegarLoop]: Abstraction has 1990 states and 2602 transitions. [2019-09-09 05:45:20,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2602 transitions. [2019-09-09 05:45:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-09-09 05:45:20,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:20,587 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:20,587 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1755141137, now seen corresponding path program 1 times [2019-09-09 05:45:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:20,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:20,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:20,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:20,902 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 604 with the following transitions: [2019-09-09 05:45:20,903 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [440], [445], [450], [455], [458], [463], [465], [470], [472], [475], [477], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:45:20,905 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:20,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:20,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:21,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:21,398 INFO L272 AbstractInterpreter]: Visited 109 different actions 1008 times. Merged at 86 different actions 754 times. Widened at 16 different actions 70 times. Performed 2303 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2303 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 97 fixpoints after 19 different actions. Largest state had 92 variables. [2019-09-09 05:45:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:21,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:21,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:21,398 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:21,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:21,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:21,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:21,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:21,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:21,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:45:21,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:21,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:21,888 INFO L87 Difference]: Start difference. First operand 1990 states and 2602 transitions. Second operand 4 states. [2019-09-09 05:45:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:22,075 INFO L93 Difference]: Finished difference Result 595 states and 739 transitions. [2019-09-09 05:45:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:45:22,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-09-09 05:45:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:22,077 INFO L225 Difference]: With dead ends: 595 [2019-09-09 05:45:22,077 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:45:22,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:45:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:45:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:45:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:45:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:45:22,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-09-09 05:45:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:22,079 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:45:22,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:45:22,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:45:22,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:22 BoogieIcfgContainer [2019-09-09 05:45:22,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:22,086 INFO L168 Benchmark]: Toolchain (without parser) took 48316.54 ms. Allocated memory was 140.5 MB in the beginning and 755.0 MB in the end (delta: 614.5 MB). Free memory was 87.5 MB in the beginning and 314.8 MB in the end (delta: -227.3 MB). Peak memory consumption was 387.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:22,086 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.5 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:45:22,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.52 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 87.5 MB in the beginning and 175.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:22,089 INFO L168 Benchmark]: Boogie Preprocessor took 60.24 ms. Allocated memory is still 201.3 MB. Free memory was 175.5 MB in the beginning and 172.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:22,089 INFO L168 Benchmark]: RCFGBuilder took 844.45 ms. Allocated memory is still 201.3 MB. Free memory was 172.7 MB in the beginning and 124.6 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:22,090 INFO L168 Benchmark]: TraceAbstraction took 46843.85 ms. Allocated memory was 201.3 MB in the beginning and 755.0 MB in the end (delta: 553.6 MB). Free memory was 124.6 MB in the beginning and 314.8 MB in the end (delta: -190.2 MB). Peak memory consumption was 363.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:22,093 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.17 ms. Allocated memory is still 140.5 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 563.52 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 87.5 MB in the beginning and 175.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.24 ms. Allocated memory is still 201.3 MB. Free memory was 175.5 MB in the beginning and 172.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.45 ms. Allocated memory is still 201.3 MB. Free memory was 172.7 MB in the beginning and 124.6 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46843.85 ms. Allocated memory was 201.3 MB in the beginning and 755.0 MB in the end (delta: 553.6 MB). Free memory was 124.6 MB in the beginning and 314.8 MB in the end (delta: -190.2 MB). Peak memory consumption was 363.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 666]: 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, 146 locations, 1 error locations. SAFE Result, 46.7s OverallTime, 32 OverallIterations, 19 TraceHistogramMax, 32.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5607 SDtfs, 10359 SDslu, 7388 SDs, 0 SdLazy, 8276 SolverSat, 1412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4231 GetRequests, 4038 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2209occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 8 AbstIntIterations, 3 AbstIntStrong, 0.6331151198003759 AbsIntWeakeningRatio, 0.5231788079470199 AbsIntAvgWeakeningVarsNumRemoved, 2.357615894039735 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 1999 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 8511 NumberOfCodeBlocks, 8511 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8997 ConstructedInterpolants, 0 QuantifiedInterpolants, 4080899 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3126 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 32422/32578 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...