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/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:04:42,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:04:42,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:04:42,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:04:42,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:04:42,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:04:42,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:04:42,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:04:42,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:04:42,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:04:42,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:04:42,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:04:42,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:04:42,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:04:42,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:04:42,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:04:42,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:04:42,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:04:42,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:04:42,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:04:42,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:04:42,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:04:42,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:04:42,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:04:42,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:04:42,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:04:42,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:04:42,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:04:42,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:04:42,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:04:42,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:04:42,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:04:42,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:04:42,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:04:42,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:04:42,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:04:42,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:04:42,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:04:42,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:04:42,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:04:42,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:04:42,613 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-03 21:04:42,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:04:42,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:04:42,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:04:42,628 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:04:42,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:04:42,629 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:04:42,629 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:04:42,630 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:04:42,630 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:04:42,630 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:04:42,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:04:42,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:04:42,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:04:42,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:04:42,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:04:42,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:04:42,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:04:42,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:04:42,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:04:42,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:04:42,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:04:42,633 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:04:42,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:04:42,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:42,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:04:42,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:04:42,634 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:04:42,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:04:42,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:04:42,634 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:04:42,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:04:42,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:04:42,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:04:42,690 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:04:42,692 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:04:42,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-03 21:04:42,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf62ca3f/081bd66b94544924a42dab4c31d6bc5e/FLAG6fa3839c3 [2019-09-03 21:04:43,155 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:04:43,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-03 21:04:43,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf62ca3f/081bd66b94544924a42dab4c31d6bc5e/FLAG6fa3839c3 [2019-09-03 21:04:43,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf62ca3f/081bd66b94544924a42dab4c31d6bc5e [2019-09-03 21:04:43,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:04:43,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:04:43,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:43,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:04:43,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:04:43,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43, skipping insertion in model container [2019-09-03 21:04:43,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,624 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:04:43,639 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:04:43,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:43,825 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:04:43,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:43,855 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:04:43,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43 WrapperNode [2019-09-03 21:04:43,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:43,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:04:43,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:04:43,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:04:43,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (1/1) ... [2019-09-03 21:04:43,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:04:43,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:04:43,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:04:43,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:04:43,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (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-03 21:04:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:04:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:04:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:04:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:04:44,195 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:04:44,195 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 21:04:44,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:44 BoogieIcfgContainer [2019-09-03 21:04:44,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:04:44,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:04:44,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:04:44,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:04:44,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:04:43" (1/3) ... [2019-09-03 21:04:44,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160c6326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:44, skipping insertion in model container [2019-09-03 21:04:44,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:43" (2/3) ... [2019-09-03 21:04:44,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160c6326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:44, skipping insertion in model container [2019-09-03 21:04:44,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:44" (3/3) ... [2019-09-03 21:04:44,214 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2019-09-03 21:04:44,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:04:44,250 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:04:44,270 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:04:44,316 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:04:44,316 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:04:44,316 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:04:44,317 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:04:44,317 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:04:44,317 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:04:44,317 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:04:44,317 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:04:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 21:04:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:44,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,368 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2019-09-03 21:04:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,475 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-03 21:04:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:04:44,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:44,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:04:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:04:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:44,498 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-03 21:04:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,512 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-03 21:04:44,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:04:44,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:04:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,521 INFO L225 Difference]: With dead ends: 20 [2019-09-03 21:04:44,521 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 21:04:44,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 21:04:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 21:04:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 21:04:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 21:04:44,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 21:04:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,557 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 21:04:44,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:04:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 21:04:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:44,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,558 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2019-09-03 21:04:44,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,669 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-03 21:04:44,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:44,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:44,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:44,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:44,672 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-03 21:04:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,711 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-03 21:04:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:44,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 21:04:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,713 INFO L225 Difference]: With dead ends: 16 [2019-09-03 21:04:44,713 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:04:44,714 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-03 21:04:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:04:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-03 21:04:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 21:04:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 21:04:44,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 21:04:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,718 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 21:04:44,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 21:04:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 21:04:44,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,720 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2019-09-03 21:04:44,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:44,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:44,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:44,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:44,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:44,790 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-03 21:04:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,810 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-03 21:04:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:44,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 21:04:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,812 INFO L225 Difference]: With dead ends: 16 [2019-09-03 21:04:44,812 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:04:44,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:04:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 21:04:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 21:04:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-03 21:04:44,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-03 21:04:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,819 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-03 21:04:44,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-03 21:04:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 21:04:44,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,827 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2019-09-03 21:04:44,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:44,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:44,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-03 21:04:44,959 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-03 21:04:44,989 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:44,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:45,053 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:45,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:45,136 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 86 root evaluator evaluations with a maximum evaluation depth of 6. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-03 21:04:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:45,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:45,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:45,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:45,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:45,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 21:04:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:45,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:45,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:45,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-09-03 21:04:45,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:45,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 21:04:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 21:04:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:45,332 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-03 21:04:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:45,390 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 21:04:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 21:04:45,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 21:04:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:45,391 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:45,392 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 21:04:45,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 21:04:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-03 21:04:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 21:04:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 21:04:45,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-03 21:04:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:45,397 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 21:04:45,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 21:04:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 21:04:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:04:45,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:45,398 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:45,398 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 199799702, now seen corresponding path program 2 times [2019-09-03 21:04:45,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:45,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:45,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:45,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:45,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:45,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:45,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:45,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:45,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-09-03 21:04:45,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:45,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:04:45,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 21:04:45,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 21:04:45,897 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 21:04:45,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 14 [2019-09-03 21:04:45,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:45,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 21:04:45,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 21:04:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-03 21:04:45,899 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-03 21:04:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:45,977 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-09-03 21:04:45,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:04:45,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 21:04:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:45,978 INFO L225 Difference]: With dead ends: 24 [2019-09-03 21:04:45,978 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 21:04:45,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-03 21:04:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 21:04:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 21:04:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 21:04:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-03 21:04:45,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-03 21:04:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:45,983 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-03 21:04:45,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 21:04:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-03 21:04:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:04:45,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:45,984 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:45,984 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1075985333, now seen corresponding path program 1 times [2019-09-03 21:04:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:45,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:45,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:45,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:46,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:46,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-03 21:04:46,079 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-03 21:04:46,083 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:46,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:46,085 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:46,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:46,136 INFO L272 AbstractInterpreter]: Visited 14 different actions 72 times. Merged at 5 different actions 28 times. Widened at 1 different actions 4 times. Performed 139 root evaluator evaluations with a maximum evaluation depth of 6. Performed 139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-03 21:04:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:46,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:46,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:46,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 21:04:46,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:46,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:46,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:46,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 21:04:46,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:46,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 21:04:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 21:04:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:46,240 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-09-03 21:04:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:46,297 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-03 21:04:46,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:04:46,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 21:04:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:46,299 INFO L225 Difference]: With dead ends: 25 [2019-09-03 21:04:46,299 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 21:04:46,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 21:04:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 21:04:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 21:04:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-03 21:04:46,303 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-09-03 21:04:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:46,304 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-03 21:04:46,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 21:04:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-03 21:04:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 21:04:46,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:46,305 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:46,305 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133644, now seen corresponding path program 2 times [2019-09-03 21:04:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:46,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:46,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:46,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:46,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:46,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:46,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:46,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:04:46,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:46,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:04:46,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:46,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:04:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2019-09-03 21:04:46,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:46,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:04:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:04:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-03 21:04:46,699 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-09-03 21:04:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:46,963 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 21:04:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 21:04:46,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-09-03 21:04:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:46,964 INFO L225 Difference]: With dead ends: 34 [2019-09-03 21:04:46,964 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 21:04:46,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-03 21:04:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 21:04:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 21:04:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 21:04:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 21:04:46,974 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-09-03 21:04:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:46,975 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 21:04:46,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:04:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 21:04:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 21:04:46,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:46,976 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:46,978 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2062781546, now seen corresponding path program 3 times [2019-09-03 21:04:46,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:46,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:46,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:47,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:47,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:47,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:47,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:47,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:47,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:47,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:47,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:04:47,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:47,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 21:04:47,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:47,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 21:04:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 21:04:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:47,263 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-09-03 21:04:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:47,372 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 21:04:47,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:04:47,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-03 21:04:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:47,374 INFO L225 Difference]: With dead ends: 34 [2019-09-03 21:04:47,374 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:04:47,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:04:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 21:04:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 21:04:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-03 21:04:47,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-09-03 21:04:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:47,380 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-03 21:04:47,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 21:04:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-03 21:04:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 21:04:47,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:47,381 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:47,382 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1147963575, now seen corresponding path program 4 times [2019-09-03 21:04:47,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:47,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:47,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:47,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:47,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:04:47,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:47,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 21:04:47,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:47,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:04:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:04:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:04:47,725 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2019-09-03 21:04:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:47,845 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-03 21:04:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 21:04:47,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-03 21:04:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:47,847 INFO L225 Difference]: With dead ends: 37 [2019-09-03 21:04:47,847 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 21:04:47,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:04:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 21:04:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 21:04:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 21:04:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-09-03 21:04:47,854 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 31 [2019-09-03 21:04:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:47,854 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-09-03 21:04:47,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:04:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-09-03 21:04:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 21:04:47,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:47,857 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:47,858 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash -760785930, now seen corresponding path program 5 times [2019-09-03 21:04:47,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:47,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:48,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:48,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:48,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:48,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,007 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) [2019-09-03 21:04:48,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:48,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:48,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:04:48,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:48,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:04:48,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:04:48,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:04:48,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:48,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2019-09-03 21:04:48,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:48,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 21:04:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 21:04:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 21:04:48,443 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2019-09-03 21:04:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:48,886 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-03 21:04:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 21:04:48,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-03 21:04:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:48,887 INFO L225 Difference]: With dead ends: 46 [2019-09-03 21:04:48,888 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 21:04:48,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-09-03 21:04:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 21:04:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 21:04:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 21:04:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-03 21:04:48,893 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-09-03 21:04:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:48,893 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-03 21:04:48,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 21:04:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-03 21:04:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 21:04:48,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,894 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,895 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1911185236, now seen corresponding path program 6 times [2019-09-03 21:04:48,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:49,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:49,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:49,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:49,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,032 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:49,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:49,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:49,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:49,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 21:04:49,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:49,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:04:49,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:49,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2019-09-03 21:04:49,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:49,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:49,430 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 13 states. [2019-09-03 21:04:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:49,737 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-03 21:04:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:04:49,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-03 21:04:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:49,744 INFO L225 Difference]: With dead ends: 52 [2019-09-03 21:04:49,744 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 21:04:49,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 21:04:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 21:04:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 21:04:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 21:04:49,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 40 [2019-09-03 21:04:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:49,749 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 21:04:49,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 21:04:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 21:04:49,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:49,751 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:49,751 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:49,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1672683157, now seen corresponding path program 7 times [2019-09-03 21:04:49,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:49,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:49,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 58 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:49,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:49,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:49,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:49,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,974 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) [2019-09-03 21:04:49,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:49,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:50,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:50,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2019-09-03 21:04:50,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:50,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 21:04:50,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 21:04:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:50,437 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 14 states. [2019-09-03 21:04:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,766 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-09-03 21:04:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 21:04:50,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-03 21:04:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,768 INFO L225 Difference]: With dead ends: 58 [2019-09-03 21:04:50,769 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 21:04:50,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 21:04:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 21:04:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 21:04:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-09-03 21:04:50,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 49 [2019-09-03 21:04:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,775 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-09-03 21:04:50,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 21:04:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-09-03 21:04:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 21:04:50,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,777 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,778 INFO L82 PathProgramCache]: Analyzing trace with hash -271959499, now seen corresponding path program 8 times [2019-09-03 21:04:50,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:50,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:51,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:51,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:51,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:51,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:51,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:51,043 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-03 21:04:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:51,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:51,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:04:51,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:51,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 21:04:51,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:53,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:04:53,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:05:08,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:08,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-09-03 21:05:08,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:08,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:05:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:05:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1069, Unknown=6, NotChecked=0, Total=1260 [2019-09-03 21:05:08,347 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 26 states. [2019-09-03 21:05:18,939 WARN L188 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-03 21:05:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:21,043 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-03 21:05:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 21:05:21,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-09-03 21:05:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:21,047 INFO L225 Difference]: With dead ends: 74 [2019-09-03 21:05:21,047 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 21:05:21,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=408, Invalid=2342, Unknown=6, NotChecked=0, Total=2756 [2019-09-03 21:05:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 21:05:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-03 21:05:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 21:05:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-03 21:05:21,055 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2019-09-03 21:05:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:21,056 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-03 21:05:21,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:05:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-03 21:05:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 21:05:21,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:21,057 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:21,057 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1938737898, now seen corresponding path program 9 times [2019-09-03 21:05:21,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:21,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:21,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 83 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:05:21,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:21,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:21,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:21,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:21,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:21,418 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-03 21:05:21,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:21,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:21,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:21,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 21:05:21,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:21,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:22,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:22,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 34 [2019-09-03 21:05:22,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:22,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 21:05:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 21:05:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:05:22,047 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 19 states. [2019-09-03 21:05:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:22,696 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2019-09-03 21:05:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 21:05:22,696 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2019-09-03 21:05:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:22,698 INFO L225 Difference]: With dead ends: 79 [2019-09-03 21:05:22,698 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 21:05:22,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:05:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 21:05:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-03 21:05:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 21:05:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-09-03 21:05:22,710 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 64 [2019-09-03 21:05:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:22,710 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-09-03 21:05:22,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 21:05:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-09-03 21:05:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 21:05:22,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:22,712 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:22,712 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1072726359, now seen corresponding path program 10 times [2019-09-03 21:05:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 98 proven. 551 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:05:23,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:23,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:23,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:23,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:23,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:23,127 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:23,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:23,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 21:05:23,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:23,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:23,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2019-09-03 21:05:23,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:23,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 21:05:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 21:05:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 21:05:23,987 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2019-09-03 21:05:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:24,828 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-03 21:05:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 21:05:24,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2019-09-03 21:05:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:24,832 INFO L225 Difference]: With dead ends: 88 [2019-09-03 21:05:24,832 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 21:05:24,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 21:05:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 21:05:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 21:05:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 21:05:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-09-03 21:05:24,838 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 73 [2019-09-03 21:05:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:24,838 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-09-03 21:05:24,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 21:05:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-09-03 21:05:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 21:05:24,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:24,840 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 20, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:24,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash -544444874, now seen corresponding path program 11 times [2019-09-03 21:05:24,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:24,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 113 proven. 737 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:05:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:25,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:25,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:25,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:25,438 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:05:25,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:25,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:25,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 21:05:25,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:25,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 21:05:25,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:26,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:05:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-03 21:05:26,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-03 21:05:35,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:35,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 47 [2019-09-03 21:05:35,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:35,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 21:05:35,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 21:05:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1947, Unknown=3, NotChecked=0, Total=2162 [2019-09-03 21:05:35,617 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 36 states. [2019-09-03 21:05:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:41,226 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-09-03 21:05:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 21:05:41,227 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2019-09-03 21:05:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:41,229 INFO L225 Difference]: With dead ends: 107 [2019-09-03 21:05:41,229 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 21:05:41,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=598, Invalid=4801, Unknown=3, NotChecked=0, Total=5402 [2019-09-03 21:05:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 21:05:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-09-03 21:05:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 21:05:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-03 21:05:41,238 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 82 [2019-09-03 21:05:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:41,238 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-03 21:05:41,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 21:05:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-03 21:05:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 21:05:41,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:41,240 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:41,240 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash 119959157, now seen corresponding path program 12 times [2019-09-03 21:05:41,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:41,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:41,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:41,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:41,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:41,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:41,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:41,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:41,712 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:41,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:41,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:41,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:41,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:41,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 21:05:41,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:41,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 21:05:43,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:43,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 21:05:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 21:05:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:05:43,373 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 27 states. [2019-09-03 21:05:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:44,744 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-03 21:05:44,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:05:44,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 91 [2019-09-03 21:05:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:44,746 INFO L225 Difference]: With dead ends: 105 [2019-09-03 21:05:44,746 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 21:05:44,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:05:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 21:05:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-03 21:05:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 21:05:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-03 21:05:44,753 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 91 [2019-09-03 21:05:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:44,754 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-03 21:05:44,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 21:05:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-03 21:05:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 21:05:44,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:44,755 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 25, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:44,755 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 463026484, now seen corresponding path program 13 times [2019-09-03 21:05:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:44,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:44,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:45,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:45,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:45,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:45,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:45,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:45,265 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:45,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:45,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 21:05:45,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:45,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:46,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:46,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 21:05:46,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:46,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:05:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:05:46,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:05:46,665 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 28 states. [2019-09-03 21:05:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:48,120 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-03 21:05:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 21:05:48,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-03 21:05:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:48,123 INFO L225 Difference]: With dead ends: 108 [2019-09-03 21:05:48,123 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 21:05:48,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:05:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 21:05:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 21:05:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 21:05:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-03 21:05:48,128 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2019-09-03 21:05:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:48,129 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-03 21:05:48,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:05:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-03 21:05:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 21:05:48,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:48,130 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 26, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:48,131 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1240399339, now seen corresponding path program 14 times [2019-09-03 21:05:48,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:48,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:48,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 282 proven. 950 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:05:48,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:48,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:48,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:48,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:48,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:48,717 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:48,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:48,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:48,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:05:48,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 21:05:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-03 21:05:49,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-03 21:05:49,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:49,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 8] total 39 [2019-09-03 21:05:49,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:49,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 21:05:49,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 21:05:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:05:49,736 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 33 states. [2019-09-03 21:05:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:55,096 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-09-03 21:05:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 21:05:55,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2019-09-03 21:05:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:55,099 INFO L225 Difference]: With dead ends: 124 [2019-09-03 21:05:55,099 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 21:05:55,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=607, Invalid=3683, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 21:05:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 21:05:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2019-09-03 21:05:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 21:05:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-03 21:05:55,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 97 [2019-09-03 21:05:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:55,116 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-03 21:05:55,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 21:05:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-03 21:05:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 21:05:55,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:55,117 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 27, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:55,118 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash 500456500, now seen corresponding path program 15 times [2019-09-03 21:05:55,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:55,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:55,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 153 proven. 1365 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:05:55,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:55,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:55,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:55,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:55,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:55,824 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:55,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:55,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:55,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:55,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:55,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 21:05:55,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:05:55,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:05:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:57,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 61 [2019-09-03 21:05:57,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:57,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 21:05:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 21:05:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:05:57,861 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 33 states. [2019-09-03 21:05:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:59,953 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-09-03 21:05:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 21:05:59,953 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-03 21:05:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:59,955 INFO L225 Difference]: With dead ends: 124 [2019-09-03 21:05:59,955 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 21:05:59,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:05:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 21:05:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 21:05:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 21:05:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-03 21:05:59,961 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 106 [2019-09-03 21:05:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:59,961 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-03 21:05:59,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 21:05:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-03 21:05:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 21:05:59,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:59,963 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 31, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:59,963 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1068497676, now seen corresponding path program 16 times [2019-09-03 21:05:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:59,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:59,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 173 proven. 1751 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:06:00,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:00,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:00,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:00,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:00,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:00,768 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:00,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:00,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 21:06:00,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:06:00,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:06:03,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:03,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34, 34] total 69 [2019-09-03 21:06:03,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:03,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 21:06:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 21:06:03,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:06:03,196 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 37 states. [2019-09-03 21:06:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:05,913 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-09-03 21:06:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 21:06:05,914 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 118 [2019-09-03 21:06:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:05,916 INFO L225 Difference]: With dead ends: 136 [2019-09-03 21:06:05,916 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 21:06:05,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:06:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 21:06:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 21:06:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 21:06:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-03 21:06:05,920 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 118 [2019-09-03 21:06:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:05,920 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-03 21:06:05,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 21:06:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-03 21:06:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 21:06:05,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:05,922 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:05,922 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1624542644, now seen corresponding path program 17 times [2019-09-03 21:06:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:05,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 193 proven. 2185 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:06:06,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:06,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:06,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:06,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:06,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:06,960 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:06,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:07,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 21:06:07,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:07,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 21:06:07,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:09,309 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-09-03 21:06:09,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-09-03 21:06:09,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-09-03 21:06:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 67 [2019-09-03 21:06:17,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:17,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 21:06:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 21:06:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=3979, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:06:17,189 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 54 states. [2019-09-03 21:06:30,139 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-03 21:06:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:30,417 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2019-09-03 21:06:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 21:06:30,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 130 [2019-09-03 21:06:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:30,420 INFO L225 Difference]: With dead ends: 157 [2019-09-03 21:06:30,420 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 21:06:30,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1139, Invalid=10633, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 21:06:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 21:06:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-09-03 21:06:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 21:06:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-09-03 21:06:30,428 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 130 [2019-09-03 21:06:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:30,428 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-09-03 21:06:30,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 21:06:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-09-03 21:06:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 21:06:30,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:30,430 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 39, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:30,430 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 348038167, now seen corresponding path program 18 times [2019-09-03 21:06:30,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:30,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:30,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 218 proven. 2795 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:06:31,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:31,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:31,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:31,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,786 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:31,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:31,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:31,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:31,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 21:06:31,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:06:31,871 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:06:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 44] total 88 [2019-09-03 21:06:35,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:35,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 21:06:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 21:06:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 21:06:35,745 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 46 states. [2019-09-03 21:06:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:40,048 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-09-03 21:06:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 21:06:40,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 145 [2019-09-03 21:06:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:40,050 INFO L225 Difference]: With dead ends: 166 [2019-09-03 21:06:40,050 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 21:06:40,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 21:06:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 21:06:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 21:06:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 21:06:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-09-03 21:06:40,055 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 145 [2019-09-03 21:06:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:40,055 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-09-03 21:06:40,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 21:06:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-09-03 21:06:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:06:40,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:40,057 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 44, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:40,058 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1151450538, now seen corresponding path program 19 times [2019-09-03 21:06:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:40,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:40,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 243 proven. 3480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:06:41,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:41,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:41,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:41,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:41,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:41,480 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:41,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:41,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:41,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 21:06:41,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:06:41,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:06:46,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:46,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 96 [2019-09-03 21:06:46,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:46,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 21:06:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 21:06:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 21:06:46,221 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 51 states. [2019-09-03 21:06:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:51,542 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2019-09-03 21:06:51,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 21:06:51,543 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 160 [2019-09-03 21:06:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:51,544 INFO L225 Difference]: With dead ends: 181 [2019-09-03 21:06:51,544 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 21:06:51,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 21:06:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 21:06:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-03 21:06:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 21:06:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2019-09-03 21:06:51,549 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 160 [2019-09-03 21:06:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:51,549 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2019-09-03 21:06:51,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 21:06:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2019-09-03 21:06:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 21:06:51,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:51,551 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 49, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:51,551 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1397457353, now seen corresponding path program 20 times [2019-09-03 21:06:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:51,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 268 proven. 4240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:06:53,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:53,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:53,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:53,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:53,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:53,212 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:53,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:54,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 21:06:54,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:54,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 21:06:54,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:55,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 21:06:55,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 780 refuted. 104 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 21:07:15,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:15,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 15, 15] total 82 [2019-09-03 21:07:15,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:15,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 21:07:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 21:07:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=6256, Unknown=6, NotChecked=0, Total=6642 [2019-09-03 21:07:15,962 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 69 states. [2019-09-03 21:07:29,133 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-09-03 21:07:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:31,260 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2019-09-03 21:07:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:07:31,260 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2019-09-03 21:07:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:31,262 INFO L225 Difference]: With dead ends: 205 [2019-09-03 21:07:31,262 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 21:07:31,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=1345, Invalid=18109, Unknown=6, NotChecked=0, Total=19460 [2019-09-03 21:07:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 21:07:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-03 21:07:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 21:07:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2019-09-03 21:07:31,269 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 175 [2019-09-03 21:07:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:31,269 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2019-09-03 21:07:31,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 21:07:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2019-09-03 21:07:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 21:07:31,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:31,271 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 54, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:31,271 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -760166635, now seen corresponding path program 21 times [2019-09-03 21:07:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:31,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:31,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 298 proven. 5251 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:07:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:33,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:33,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:33,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:33,342 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:33,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:33,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:33,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:33,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:33,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 21:07:33,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:07:33,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:07:40,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:40,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 57, 57] total 117 [2019-09-03 21:07:40,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:40,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 21:07:40,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 21:07:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 21:07:40,283 INFO L87 Difference]: Start difference. First operand 198 states and 202 transitions. Second operand 62 states. [2019-09-03 21:07:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:48,266 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2019-09-03 21:07:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 21:07:48,267 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 193 [2019-09-03 21:07:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:48,269 INFO L225 Difference]: With dead ends: 217 [2019-09-03 21:07:48,269 INFO L226 Difference]: Without dead ends: 217 [2019-09-03 21:07:48,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 331 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 21:07:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-03 21:07:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-09-03 21:07:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 21:07:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-09-03 21:07:48,275 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 193 [2019-09-03 21:07:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:48,275 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-09-03 21:07:48,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 21:07:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-09-03 21:07:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 21:07:48,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:48,277 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 60, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:48,277 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash 24031733, now seen corresponding path program 22 times [2019-09-03 21:07:48,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:48,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:48,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 328 proven. 6370 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:07:50,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:50,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:50,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:50,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:50,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:50,890 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:50,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:50,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 21:07:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:07:51,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:07:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 63, 63] total 129 [2019-09-03 21:07:59,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:59,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:07:59,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:07:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 21:07:59,230 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 68 states. [2019-09-03 21:08:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:08,857 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2019-09-03 21:08:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 21:08:08,858 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 211 [2019-09-03 21:08:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:08,860 INFO L225 Difference]: With dead ends: 235 [2019-09-03 21:08:08,860 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 21:08:08,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 21:08:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 21:08:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-09-03 21:08:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-03 21:08:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 238 transitions. [2019-09-03 21:08:08,865 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 238 transitions. Word has length 211 [2019-09-03 21:08:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:08,866 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 238 transitions. [2019-09-03 21:08:08,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:08:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2019-09-03 21:08:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 21:08:08,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:08,867 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 66, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:08,868 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1923373867, now seen corresponding path program 23 times [2019-09-03 21:08:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:08,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 358 proven. 7597 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:08:11,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:11,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:11,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:11,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:11,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:11,649 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:11,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:11,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:08:16,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 21:08:16,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 21:08:16,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-03 21:08:24,083 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-03 21:08:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:58,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 17, 17] total 104 [2019-09-03 21:08:58,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:58,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 21:08:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 21:08:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=9980, Unknown=6, NotChecked=0, Total=10712 [2019-09-03 21:08:58,484 INFO L87 Difference]: Start difference. First operand 234 states and 238 transitions. Second operand 89 states. [2019-09-03 21:09:32,088 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-03 21:09:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:32,422 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2019-09-03 21:09:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 21:09:32,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 229 [2019-09-03 21:09:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:32,425 INFO L225 Difference]: With dead ends: 262 [2019-09-03 21:09:32,425 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 21:09:32,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3107 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=2131, Invalid=29723, Unknown=8, NotChecked=0, Total=31862 [2019-09-03 21:09:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 21:09:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-03 21:09:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 21:09:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 259 transitions. [2019-09-03 21:09:32,432 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 259 transitions. Word has length 229 [2019-09-03 21:09:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:32,432 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 259 transitions. [2019-09-03 21:09:32,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 21:09:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 259 transitions. [2019-09-03 21:09:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-03 21:09:32,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:32,434 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 72, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:32,434 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash -568596682, now seen corresponding path program 24 times [2019-09-03 21:09:32,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:32,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:32,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 393 proven. 9165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:09:36,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:36,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:36,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:36,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:36,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:36,125 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:36,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:36,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:36,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:36,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:36,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 21:09:36,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:09:36,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:09:48,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 75, 75] total 154 [2019-09-03 21:09:48,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:48,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 21:09:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 21:09:48,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:09:48,237 INFO L87 Difference]: Start difference. First operand 255 states and 259 transitions. Second operand 81 states. [2019-09-03 21:10:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:02,015 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2019-09-03 21:10:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 21:10:02,016 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 250 [2019-09-03 21:10:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:02,018 INFO L225 Difference]: With dead ends: 277 [2019-09-03 21:10:02,018 INFO L226 Difference]: Without dead ends: 277 [2019-09-03 21:10:02,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 427 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:10:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-03 21:10:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-09-03 21:10:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 21:10:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2019-09-03 21:10:02,025 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 250 [2019-09-03 21:10:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:02,026 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2019-09-03 21:10:02,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 21:10:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2019-09-03 21:10:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-03 21:10:02,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:02,028 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 79, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:02,028 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash -147337353, now seen corresponding path program 25 times [2019-09-03 21:10:02,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:02,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:02,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:02,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 428 proven. 10880 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:10:05,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:05,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:05,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:05,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:05,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:05,928 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:05,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:05,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:06,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 21:10:06,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9401 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:10:06,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9398 refuted. 3 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:10:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 82, 82] total 168 [2019-09-03 21:10:22,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:22,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 21:10:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 21:10:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7298, Invalid=20757, Unknown=1, NotChecked=0, Total=28056 [2019-09-03 21:10:22,714 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 88 states. [2019-09-03 21:10:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:39,138 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2019-09-03 21:10:39,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 21:10:39,139 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 271 [2019-09-03 21:10:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:39,140 INFO L225 Difference]: With dead ends: 298 [2019-09-03 21:10:39,141 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 21:10:39,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 462 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=7298, Invalid=20757, Unknown=1, NotChecked=0, Total=28056 [2019-09-03 21:10:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 21:10:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-03 21:10:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 21:10:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2019-09-03 21:10:39,148 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 271 [2019-09-03 21:10:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:39,148 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2019-09-03 21:10:39,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 21:10:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2019-09-03 21:10:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 21:10:39,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:39,150 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 86, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:39,151 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2045687338, now seen corresponding path program 26 times [2019-09-03 21:10:39,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:39,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:39,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 463 proven. 12742 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:10:44,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:44,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:44,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:44,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:44,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:44,443 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:10:44,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:11:10,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 21:11:10,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:10,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 21:11:10,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-03 21:11:12,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-03 21:11:19,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:19,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 16, 16] total 123 [2019-09-03 21:11:19,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:19,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 21:11:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 21:11:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=14264, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 21:11:19,740 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 109 states. [2019-09-03 21:11:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:49,666 INFO L93 Difference]: Finished difference Result 331 states and 337 transitions. [2019-09-03 21:11:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 21:11:49,667 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 292 [2019-09-03 21:11:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:49,670 INFO L225 Difference]: With dead ends: 331 [2019-09-03 21:11:49,670 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 21:11:49,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 557 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4670 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2436, Invalid=44870, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:11:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 21:11:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 323. [2019-09-03 21:11:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-03 21:11:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 327 transitions. [2019-09-03 21:11:49,678 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 327 transitions. Word has length 292 [2019-09-03 21:11:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:49,679 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 327 transitions. [2019-09-03 21:11:49,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 21:11:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 327 transitions. [2019-09-03 21:11:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 21:11:49,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:49,681 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 93, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:49,682 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:49,682 INFO L82 PathProgramCache]: Analyzing trace with hash -541127980, now seen corresponding path program 27 times [2019-09-03 21:11:49,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:49,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:49,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 503 proven. 15050 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:11:54,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:54,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:54,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:54,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:54,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:54,909 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:11:54,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:11:55,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:11:55,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:55,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 189 conjunts are in the unsatisfiable core [2019-09-03 21:11:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:11:55,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:12:14,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:14,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 96, 96] total 197 [2019-09-03 21:12:14,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:14,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 21:12:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 21:12:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-03 21:12:14,481 INFO L87 Difference]: Start difference. First operand 323 states and 327 transitions. Second operand 103 states. [2019-09-03 21:12:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:37,093 INFO L93 Difference]: Finished difference Result 348 states and 352 transitions. [2019-09-03 21:12:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 21:12:37,094 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 316 [2019-09-03 21:12:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:37,096 INFO L225 Difference]: With dead ends: 348 [2019-09-03 21:12:37,096 INFO L226 Difference]: Without dead ends: 348 [2019-09-03 21:12:37,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 538 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-03 21:12:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-03 21:12:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-03 21:12:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-03 21:12:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2019-09-03 21:12:37,108 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 316 [2019-09-03 21:12:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:37,109 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2019-09-03 21:12:37,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 21:12:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2019-09-03 21:12:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 21:12:37,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:37,111 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 101, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:37,111 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:37,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash -155067308, now seen corresponding path program 28 times [2019-09-03 21:12:37,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:37,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:37,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 543 proven. 17550 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:12:43,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:43,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:43,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:43,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:43,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:43,071 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:43,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:12:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:43,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 205 conjunts are in the unsatisfiable core [2019-09-03 21:12:43,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:12:43,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:13:05,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:05,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 104, 104] total 213 [2019-09-03 21:13:05,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:05,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 21:13:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 21:13:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 21:13:05,901 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 111 states. [2019-09-03 21:13:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:32,179 INFO L93 Difference]: Finished difference Result 372 states and 376 transitions. [2019-09-03 21:13:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 21:13:32,179 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 340 [2019-09-03 21:13:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:32,182 INFO L225 Difference]: With dead ends: 372 [2019-09-03 21:13:32,182 INFO L226 Difference]: Without dead ends: 372 [2019-09-03 21:13:32,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 578 SyntacticMatches, 3 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 21:13:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-03 21:13:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2019-09-03 21:13:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-03 21:13:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 375 transitions. [2019-09-03 21:13:32,191 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 375 transitions. Word has length 340 [2019-09-03 21:13:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:32,192 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 375 transitions. [2019-09-03 21:13:32,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 21:13:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 375 transitions. [2019-09-03 21:13:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 21:13:32,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:32,194 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 109, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:32,194 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 784870868, now seen corresponding path program 29 times [2019-09-03 21:13:32,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:32,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:13:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:32,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 583 proven. 20242 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:13:38,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:38,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:38,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:38,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:38,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:38,858 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:13:38,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:13:38,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:16:02,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 21:16:02,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:02,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 21:16:02,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 3151 proven. 126 refuted. 0 times theorem prover too weak. 17550 trivial. 0 not checked. [2019-09-03 21:16:10,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 3274 refuted. 3 times theorem prover too weak. 17550 trivial. 0 not checked. [2019-09-03 21:16:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 15, 16] total 146 [2019-09-03 21:16:37,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:37,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 21:16:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 21:16:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=19403, Unknown=7, NotChecked=0, Total=21170 [2019-09-03 21:16:37,454 INFO L87 Difference]: Start difference. First operand 371 states and 375 transitions. Second operand 132 states. [2019-09-03 21:16:58,967 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 44 DAG size of output: 8 [2019-09-03 21:17:13,075 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 8 [2019-09-03 21:17:18,185 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 44 DAG size of output: 8 [2019-09-03 21:17:24,021 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 8