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/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:16:33,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:16:33,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:16:33,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:16:33,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:16:33,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:16:33,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:16:33,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:16:33,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:16:33,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:16:33,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:16:33,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:16:33,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:16:33,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:16:33,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:16:33,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:16:33,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:16:33,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:16:33,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:16:33,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:16:33,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:16:33,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:16:33,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:16:33,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:16:33,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:16:33,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:16:33,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:16:33,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:16:33,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:16:33,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:16:33,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:16:33,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:16:33,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:16:33,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:16:33,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:16:33,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:16:33,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:16:33,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:16:33,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:16:33,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:16:33,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:16:33,706 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-10 02:16:33,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:16:33,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:16:33,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:16:33,726 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:16:33,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:16:33,727 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:16:33,727 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:16:33,727 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:16:33,728 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:16:33,728 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:16:33,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:16:33,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:16:33,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:16:33,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:16:33,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:16:33,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:16:33,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:16:33,730 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:16:33,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:16:33,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:16:33,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:16:33,731 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:16:33,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:16:33,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:16:33,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:16:33,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:16:33,732 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:16:33,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:16:33,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:16:33,732 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:16:33,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:16:33,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:16:33,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:16:33,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:16:33,785 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:16:33,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2019-09-10 02:16:33,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b8edf9e/85f6420d7027484c8d3371ff1837202d/FLAG02d8cfa7e [2019-09-10 02:16:34,280 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:16:34,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2019-09-10 02:16:34,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b8edf9e/85f6420d7027484c8d3371ff1837202d/FLAG02d8cfa7e [2019-09-10 02:16:34,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b8edf9e/85f6420d7027484c8d3371ff1837202d [2019-09-10 02:16:34,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:16:34,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:16:34,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:16:34,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:16:34,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:16:34,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ea378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34, skipping insertion in model container [2019-09-10 02:16:34,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,663 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:16:34,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:16:34,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:16:34,853 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:16:34,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:16:34,882 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:16:34,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34 WrapperNode [2019-09-10 02:16:34,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:16:34,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:16:34,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:16:34,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:16:34,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:34,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:35,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:35,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... [2019-09-10 02:16:35,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:16:35,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:16:35,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:16:35,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:16:35,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:16:35,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:16:35,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:16:35,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:16:35,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:16:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:16:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:16:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:16:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:16:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:16:35,214 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:16:35,215 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:16:35,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:16:35 BoogieIcfgContainer [2019-09-10 02:16:35,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:16:35,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:16:35,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:16:35,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:16:35,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:16:34" (1/3) ... [2019-09-10 02:16:35,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdaf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:16:35, skipping insertion in model container [2019-09-10 02:16:35,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:34" (2/3) ... [2019-09-10 02:16:35,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdaf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:16:35, skipping insertion in model container [2019-09-10 02:16:35,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:16:35" (3/3) ... [2019-09-10 02:16:35,224 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2019-09-10 02:16:35,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:16:35,241 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:16:35,258 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:16:35,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:16:35,285 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:16:35,285 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:16:35,285 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:16:35,285 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:16:35,286 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:16:35,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:16:35,286 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:16:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 02:16:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:16:35,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:35,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:35,313 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2019-09-10 02:16:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:35,404 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-10 02:16:35,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:16:35,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:16:35,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:35,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:16:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:16:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:16:35,422 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-10 02:16:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:35,440 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 02:16:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:16:35,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:16:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:35,450 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:16:35,451 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 02:16:35,453 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-10 02:16:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 02:16:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 02:16:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 02:16:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-10 02:16:35,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-10 02:16:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:35,492 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-10 02:16:35,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:16:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-10 02:16:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:16:35,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:35,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:35,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-10 02:16:35,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:35,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:35,754 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-10 02:16:35,757 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-10 02:16:35,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:16:35,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:16:35,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:35,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:16:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:16:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:35,763 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-10 02:16:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:35,817 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-10 02:16:35,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:16:35,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:16:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:35,819 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:16:35,820 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:16:35,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:16:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-10 02:16:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 02:16:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-10 02:16:35,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-09-10 02:16:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:35,830 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-10 02:16:35,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:16:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-10 02:16:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:16:35,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:35,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:35,831 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1264308876, now seen corresponding path program 1 times [2019-09-10 02:16:35,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:35,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:35,947 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-10 02:16:35,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:35,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:35,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 02:16:35,951 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-10 02:16:35,983 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:16:35,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:16:36,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:16:36,113 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:16:36,116 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 6. Performed 105 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-10 02:16:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:36,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:16:36,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:36,121 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-10 02:16:36,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:36,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:36,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:16:36,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:36,227 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-10 02:16:36,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:36,356 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-10 02:16:36,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2019-09-10 02:16:36,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:36,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:16:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:16:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:16:36,362 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-10 02:16:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:36,422 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 02:16:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:16:36,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 02:16:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:36,424 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:16:36,424 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:16:36,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:16:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:16:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-10 02:16:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 02:16:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 02:16:36,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 02:16:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:36,429 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 02:16:36,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:16:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 02:16:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:16:36,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:36,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:36,431 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 127284375, now seen corresponding path program 2 times [2019-09-10 02:16:36,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:36,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:36,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:36,543 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-10 02:16:36,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:36,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:36,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:36,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:36,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:36,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:36,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:16:36,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:36,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 02:16:36,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:16:36,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:16:36,680 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:16:36,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2019-09-10 02:16:36,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:36,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:16:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:16:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:16:36,682 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-09-10 02:16:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:39,170 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-10 02:16:39,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:16:39,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:16:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:39,172 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:16:39,172 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:16:39,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:16:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:16:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-10 02:16:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 02:16:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-10 02:16:39,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-10 02:16:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:39,177 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-10 02:16:39,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:16:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-10 02:16:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:16:39,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:39,178 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:39,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash -462476010, now seen corresponding path program 1 times [2019-09-10 02:16:39,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:39,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:39,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:39,297 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-10 02:16:39,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:39,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 02:16:39,298 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-10 02:16:39,301 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:16:39,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:16:39,303 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:16:39,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:16:39,344 INFO L272 AbstractInterpreter]: Visited 14 different actions 70 times. Merged at 5 different actions 26 times. Widened at 1 different actions 4 times. Performed 152 root evaluator evaluations with a maximum evaluation depth of 6. Performed 152 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-10 02:16:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:39,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:16:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:39,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:39,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:39,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:16:39,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:39,411 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-10 02:16:39,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:39,506 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-10 02:16:39,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:39,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-10 02:16:39,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:39,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:16:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:16:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:16:39,513 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-09-10 02:16:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:39,569 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-10 02:16:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:16:39,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 02:16:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:39,570 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:16:39,570 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:16:39,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:16:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:16:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-10 02:16:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:16:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-10 02:16:39,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2019-09-10 02:16:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:39,575 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-10 02:16:39,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:16:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-10 02:16:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:16:39,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:39,576 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:39,577 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:39,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1090129401, now seen corresponding path program 2 times [2019-09-10 02:16:39,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:39,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:39,728 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-10 02:16:39,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:39,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:39,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:39,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,729 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-10 02:16:39,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:39,744 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-10 02:16:39,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:16:39,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:39,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:16:39,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:39,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:39,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:39,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2019-09-10 02:16:39,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:39,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:16:39,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:16:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:16:39,878 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-10 02:16:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:41,654 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-10 02:16:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:16:41,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 02:16:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:41,655 INFO L225 Difference]: With dead ends: 38 [2019-09-10 02:16:41,655 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:16:41,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:16:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:16:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-09-10 02:16:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:16:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-10 02:16:41,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2019-09-10 02:16:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:41,662 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-10 02:16:41,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:16:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-10 02:16:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:16:41,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:41,663 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:41,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 383195540, now seen corresponding path program 3 times [2019-09-10 02:16:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:41,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:41,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:41,797 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-10 02:16:41,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:41,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:41,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:41,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:41,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:41,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:16:41,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:41,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:41,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:41,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:41,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:16:41,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:41,896 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-10 02:16:41,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:42,142 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-10 02:16:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-10 02:16:42,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:42,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:16:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:16:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:16:42,148 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-10 02:16:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:42,265 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-10 02:16:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:16:42,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-10 02:16:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:42,266 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:16:42,266 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 02:16:42,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:16:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 02:16:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-10 02:16:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:16:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-10 02:16:42,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2019-09-10 02:16:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:42,272 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-10 02:16:42,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:16:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-10 02:16:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:16:42,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:42,273 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:42,273 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash 406896119, now seen corresponding path program 4 times [2019-09-10 02:16:42,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:42,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:42,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:42,406 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-10 02:16:42,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:42,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:42,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:42,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:42,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:42,408 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-10 02:16:42,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:42,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:42,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:16:42,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:42,490 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-10 02:16:42,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:42,704 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-10 02:16:42,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:42,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2019-09-10 02:16:42,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:42,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:16:42,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:16:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:16:42,710 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2019-09-10 02:16:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:42,867 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-10 02:16:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:16:42,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-10 02:16:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:42,870 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:16:42,870 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:16:42,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:16:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:16:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-10 02:16:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:16:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-10 02:16:42,876 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-09-10 02:16:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:42,876 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-10 02:16:42,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:16:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-10 02:16:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 02:16:42,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:42,878 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:42,878 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2096208564, now seen corresponding path program 5 times [2019-09-10 02:16:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:42,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:16:43,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:43,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:43,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:43,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:43,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:43,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:43,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:43,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:43,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:16:43,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:43,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:16:43,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:16:43,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:16:43,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2019-09-10 02:16:43,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:43,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:16:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:16:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:16:43,235 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-09-10 02:16:47,602 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-09-10 02:16:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:49,301 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-09-10 02:16:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:16:49,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-10 02:16:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:49,304 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:16:49,305 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:16:49,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:16:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:16:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-09-10 02:16:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:16:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-10 02:16:49,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-09-10 02:16:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:49,311 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-10 02:16:49,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:16:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-10 02:16:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:16:49,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:49,313 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:49,313 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1039399097, now seen corresponding path program 6 times [2019-09-10 02:16:49,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:49,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:49,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:49,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:49,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:49,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:49,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:49,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:49,510 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:49,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:49,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:16:49,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:49,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:49,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:16:49,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:49,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:50,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:50,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2019-09-10 02:16:50,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:50,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:16:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:16:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:16:50,030 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 13 states. [2019-09-10 02:16:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:50,323 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-09-10 02:16:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:16:50,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-09-10 02:16:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:50,325 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:16:50,325 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:16:50,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:16:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:16:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-10 02:16:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:16:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-10 02:16:50,331 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2019-09-10 02:16:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:50,332 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-10 02:16:50,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:16:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-10 02:16:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 02:16:50,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:50,333 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:50,334 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -889806346, now seen corresponding path program 7 times [2019-09-10 02:16:50,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:50,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:50,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:50,536 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-10 02:16:50,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:50,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:50,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:50,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:50,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:50,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:50,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:50,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:16:50,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:50,714 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-10 02:16:50,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:51,364 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-10 02:16:51,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:51,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-10 02:16:51,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:51,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:16:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:16:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:16:51,376 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2019-09-10 02:16:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:51,740 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-09-10 02:16:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:16:51,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-10 02:16:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:51,742 INFO L225 Difference]: With dead ends: 54 [2019-09-10 02:16:51,742 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 02:16:51,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:16:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 02:16:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-10 02:16:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:16:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-09-10 02:16:51,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2019-09-10 02:16:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:51,749 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-09-10 02:16:51,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:16:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-09-10 02:16:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:16:51,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:51,750 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:51,750 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1403196313, now seen corresponding path program 8 times [2019-09-10 02:16:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:51,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 93 proven. 187 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:16:51,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:51,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:51,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:51,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:51,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:51,982 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-10 02:16:52,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:52,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:52,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:16:52,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:52,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:16:52,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 02:16:52,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 02:16:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:52,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2019-09-10 02:16:52,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:52,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:16:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:16:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:16:52,329 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2019-09-10 02:16:55,409 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:16:56,890 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-10 02:17:04,419 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-10 02:17:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:04,462 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-09-10 02:17:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:17:04,462 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-10 02:17:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:04,463 INFO L225 Difference]: With dead ends: 74 [2019-09-10 02:17:04,463 INFO L226 Difference]: Without dead ends: 74 [2019-09-10 02:17:04,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=397, Invalid=723, Unknown=2, NotChecked=0, Total=1122 [2019-09-10 02:17:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-10 02:17:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-09-10 02:17:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 02:17:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-09-10 02:17:04,472 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 52 [2019-09-10 02:17:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:04,472 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-09-10 02:17:04,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:17:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-09-10 02:17:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 02:17:04,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:04,474 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:04,474 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 120846324, now seen corresponding path program 9 times [2019-09-10 02:17:04,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:04,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:04,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:04,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:04,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,771 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-10 02:17:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:04,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:04,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:04,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:04,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:17:04,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:04,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:05,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-10 02:17:05,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:05,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:17:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:17:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:17:05,757 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 17 states. [2019-09-10 02:17:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:06,242 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-09-10 02:17:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:17:06,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-10 02:17:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:06,243 INFO L225 Difference]: With dead ends: 66 [2019-09-10 02:17:06,243 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 02:17:06,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:17:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 02:17:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-10 02:17:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:17:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-10 02:17:06,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 61 [2019-09-10 02:17:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:06,250 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-10 02:17:06,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:17:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-10 02:17:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:17:06,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:06,251 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:06,251 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1590948585, now seen corresponding path program 10 times [2019-09-10 02:17:06,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:06,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:06,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:06,505 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-10 02:17:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:06,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:06,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:06,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:06,506 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) [2019-09-10 02:17:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:06,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:06,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:17:06,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:06,624 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-10 02:17:06,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:07,638 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-10 02:17:07,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:07,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-10 02:17:07,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:07,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:17:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:17:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:17:07,643 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 18 states. [2019-09-10 02:17:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:08,222 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-10 02:17:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:17:08,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-09-10 02:17:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:08,223 INFO L225 Difference]: With dead ends: 69 [2019-09-10 02:17:08,223 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 02:17:08,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:17:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 02:17:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-10 02:17:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 02:17:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-10 02:17:08,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 64 [2019-09-10 02:17:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:08,230 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-10 02:17:08,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:17:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-10 02:17:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 02:17:08,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:08,231 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:08,231 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 768590100, now seen corresponding path program 11 times [2019-09-10 02:17:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:08,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:08,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 172 proven. 345 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:08,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:08,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:08,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:08,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:08,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:08,530 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:08,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:08,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:08,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:17:08,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:08,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:17:08,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 26 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 02:17:08,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 26 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 02:17:08,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:08,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2019-09-10 02:17:08,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:08,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:17:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:17:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:17:08,932 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 24 states. [2019-09-10 02:17:13,693 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:17:16,507 WARN L188 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:17:19,262 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:17:38,963 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:17:41,877 WARN L188 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-09-10 02:17:59,145 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-10 02:18:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:00,176 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-09-10 02:18:00,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:18:00,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-10 02:18:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:00,177 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:18:00,177 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 02:18:00,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=690, Invalid=1279, Unknown=11, NotChecked=0, Total=1980 [2019-09-10 02:18:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 02:18:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2019-09-10 02:18:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-10 02:18:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-10 02:18:00,197 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 67 [2019-09-10 02:18:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:00,198 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-10 02:18:00,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:18:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-10 02:18:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 02:18:00,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:00,199 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:00,199 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:00,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1916235353, now seen corresponding path program 12 times [2019-09-10 02:18:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:00,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:00,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 247 proven. 442 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:00,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:00,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:00,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:00,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:00,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:00,509 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-10 02:18:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:00,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:00,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:00,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:18:00,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 103 proven. 610 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:00,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 103 proven. 610 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:03,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 46 [2019-09-10 02:18:03,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:03,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:18:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:18:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:18:03,653 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 24 states. [2019-09-10 02:18:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:04,645 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-10 02:18:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:18:04,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-09-10 02:18:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:04,647 INFO L225 Difference]: With dead ends: 90 [2019-09-10 02:18:04,647 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 02:18:04,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:18:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 02:18:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-10 02:18:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-10 02:18:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-09-10 02:18:04,657 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 76 [2019-09-10 02:18:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:04,657 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-09-10 02:18:04,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:18:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-09-10 02:18:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:18:04,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:04,660 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 21, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:04,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 70216729, now seen corresponding path program 13 times [2019-09-10 02:18:04,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 672 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:05,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:05,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:05,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:05,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,148 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) [2019-09-10 02:18:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:05,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:05,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:18:05,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 672 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:05,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 672 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:08,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:08,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2019-09-10 02:18:08,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:08,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:18:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:18:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1611, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:18:08,861 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 25 states. [2019-09-10 02:18:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:09,965 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-10 02:18:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:18:09,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2019-09-10 02:18:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:09,968 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:18:09,968 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:18:09,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=645, Invalid=1611, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:18:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:18:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-10 02:18:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-10 02:18:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2019-09-10 02:18:09,974 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 88 [2019-09-10 02:18:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:09,975 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2019-09-10 02:18:09,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:18:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2019-09-10 02:18:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:18:09,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:09,976 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:09,976 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 23476502, now seen corresponding path program 14 times [2019-09-10 02:18:09,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:09,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 317 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:10,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:10,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:10,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:10,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:10,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:10,454 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) [2019-09-10 02:18:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:10,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:10,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:18:10,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:10,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:18:10,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 40 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 02:18:10,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 40 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 02:18:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9] total 39 [2019-09-10 02:18:11,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:11,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:18:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:18:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:18:11,079 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 32 states. [2019-09-10 02:18:15,116 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:18:30,418 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:18:41,130 WARN L188 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:19:06,214 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-10 02:19:10,694 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-10 02:19:18,350 WARN L188 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-10 02:19:18,808 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:19:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:18,911 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2019-09-10 02:19:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:19:18,912 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-10 02:19:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:18,913 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:19:18,913 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:19:18,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=1077, Invalid=2099, Unknown=16, NotChecked=0, Total=3192 [2019-09-10 02:19:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:19:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-09-10 02:19:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 02:19:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-10 02:19:18,918 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 91 [2019-09-10 02:19:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:18,918 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-10 02:19:18,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:19:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-10 02:19:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:19:18,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:18,920 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 24, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:18,920 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash -932954345, now seen corresponding path program 15 times [2019-09-10 02:19:18,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:18,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:18,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:18,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:19,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:19,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:19,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:19,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:19,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:19,456 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-10 02:19:19,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:19:19,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:19:19,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:19:19,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:19,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-10 02:19:19,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:19,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:22,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:22,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 54 [2019-09-10 02:19:22,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:22,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:19:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:19:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:19:22,275 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 28 states. [2019-09-10 02:19:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:23,739 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-10 02:19:23,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:19:23,741 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2019-09-10 02:19:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:23,742 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:19:23,742 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 02:19:23,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:19:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 02:19:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-10 02:19:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-10 02:19:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-10 02:19:23,746 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 100 [2019-09-10 02:19:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:23,746 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-10 02:19:23,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:19:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-10 02:19:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:19:23,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:23,748 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 25, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:23,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -985237356, now seen corresponding path program 16 times [2019-09-10 02:19:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:23,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:23,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:24,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:24,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:24,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:24,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:24,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:24,303 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-10 02:19:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:24,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:19:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:24,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 02:19:24,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:24,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:28,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-10 02:19:28,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:28,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:19:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:19:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:19:28,051 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 29 states. [2019-09-10 02:19:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:29,587 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-10 02:19:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:19:29,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 103 [2019-09-10 02:19:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:29,588 INFO L225 Difference]: With dead ends: 108 [2019-09-10 02:19:29,588 INFO L226 Difference]: Without dead ends: 108 [2019-09-10 02:19:29,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:19:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-10 02:19:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-10 02:19:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-10 02:19:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-10 02:19:29,592 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 103 [2019-09-10 02:19:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:29,593 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-10 02:19:29,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:19:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-10 02:19:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:19:29,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:29,594 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:29,594 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 524710391, now seen corresponding path program 17 times [2019-09-10 02:19:29,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:29,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:29,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 453 proven. 1027 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:30,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:30,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:30,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:30,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:30,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:30,193 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-10 02:19:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:19:30,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:19:30,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:19:30,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:30,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:19:30,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 513 proven. 57 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-10 02:19:30,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 513 proven. 57 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-10 02:19:30,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:30,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10] total 45 [2019-09-10 02:19:30,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:30,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:19:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:19:30,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=1406, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:19:30,928 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 37 states. [2019-09-10 02:19:35,153 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-10 02:19:38,727 WARN L188 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:19:48,785 WARN L188 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:19:54,451 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:20:04,369 WARN L188 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:20:07,196 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:20:30,145 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:20:34,983 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-09-10 02:20:44,934 WARN L188 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 02:20:48,563 WARN L188 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:20:54,452 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:20:57,601 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:21:07,585 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:21:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:08,885 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2019-09-10 02:21:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:21:08,886 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-10 02:21:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:08,886 INFO L225 Difference]: With dead ends: 139 [2019-09-10 02:21:08,887 INFO L226 Difference]: Without dead ends: 139 [2019-09-10 02:21:08,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=1454, Invalid=2827, Unknown=9, NotChecked=0, Total=4290 [2019-09-10 02:21:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-10 02:21:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2019-09-10 02:21:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-10 02:21:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-09-10 02:21:08,891 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 106 [2019-09-10 02:21:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:08,891 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-09-10 02:21:08,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:21:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-09-10 02:21:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:21:08,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:08,892 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 28, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:08,892 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash -362906410, now seen corresponding path program 18 times [2019-09-10 02:21:08,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:08,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:08,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:08,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:08,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:09,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:09,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:09,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:09,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:09,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:09,521 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-10 02:21:09,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:21:09,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:21:09,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:21:09,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:21:09,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-10 02:21:09,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:09,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:17,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:17,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-10 02:21:17,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:17,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:21:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:21:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:21:17,227 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 32 states. [2019-09-10 02:21:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:19,054 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-09-10 02:21:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:21:19,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2019-09-10 02:21:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:19,060 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:21:19,060 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:21:19,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:21:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:21:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-10 02:21:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-10 02:21:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2019-09-10 02:21:19,064 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 115 [2019-09-10 02:21:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:19,065 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2019-09-10 02:21:19,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:21:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2019-09-10 02:21:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:21:19,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:19,066 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:19,066 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:19,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -337872455, now seen corresponding path program 19 times [2019-09-10 02:21:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:19,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:19,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:19,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:19,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:19,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:19,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:19,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:19,700 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-10 02:21:19,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:19,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:21:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:19,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-10 02:21:19,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:19,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-10 02:21:25,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:25,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:21:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:21:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:21:25,830 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 33 states. [2019-09-10 02:21:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:27,857 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-09-10 02:21:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:21:27,858 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2019-09-10 02:21:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:27,859 INFO L225 Difference]: With dead ends: 123 [2019-09-10 02:21:27,860 INFO L226 Difference]: Without dead ends: 123 [2019-09-10 02:21:27,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:21:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-10 02:21:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-10 02:21:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-10 02:21:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-09-10 02:21:27,865 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 118 [2019-09-10 02:21:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:27,866 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-09-10 02:21:27,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:21:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-09-10 02:21:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:21:27,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:27,867 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 30, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:27,867 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1875628554, now seen corresponding path program 20 times [2019-09-10 02:21:27,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:27,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:27,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:27,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:27,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 613 proven. 1365 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:21:28,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:28,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:28,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:28,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:28,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:28,541 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-10 02:21:28,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:21:28,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:21:28,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:21:28,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:21:28,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:21:28,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 682 proven. 77 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-10 02:21:28,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 682 proven. 77 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-10 02:21:29,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:29,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11, 11] total 51 [2019-09-10 02:21:29,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:29,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:21:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:21:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1826, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:21:29,475 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 42 states. [2019-09-10 02:21:49,626 WARN L188 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 14 [2019-09-10 02:22:09,786 WARN L188 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:22:25,148 WARN L188 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-09-10 02:22:36,312 WARN L188 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:22:54,172 WARN L188 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:23:07,868 WARN L188 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 34 DAG size of output: 14 [2019-09-10 02:23:15,711 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:23:45,518 WARN L188 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:24:10,521 WARN L188 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:24:17,704 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 02:24:22,343 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 02:24:23,326 WARN L188 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-10 02:24:26,536 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:24:36,724 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:24:40,382 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:24:51,862 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:24:58,553 WARN L188 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:25:17,373 WARN L188 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-10 02:25:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:17,376 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2019-09-10 02:25:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:25:17,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-10 02:25:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:17,378 INFO L225 Difference]: With dead ends: 158 [2019-09-10 02:25:17,379 INFO L226 Difference]: Without dead ends: 158 [2019-09-10 02:25:17,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 207.2s TimeCoverageRelationStatistics Valid=1854, Invalid=3673, Unknown=23, NotChecked=0, Total=5550 [2019-09-10 02:25:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-10 02:25:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2019-09-10 02:25:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-10 02:25:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2019-09-10 02:25:17,382 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 121 [2019-09-10 02:25:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:17,382 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2019-09-10 02:25:17,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:25:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2019-09-10 02:25:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:25:17,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:17,384 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 32, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:17,384 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1774365129, now seen corresponding path program 21 times [2019-09-10 02:25:17,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:17,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:25:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:17,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:18,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:18,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:18,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:18,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:18,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:18,185 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-10 02:25:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:25:18,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:25:18,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:25:18,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:25:18,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 02:25:18,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:18,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:23,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:23,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 36] total 70 [2019-09-10 02:25:23,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:23,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:25:23,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:25:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:25:23,211 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2019-09-10 02:25:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:25,752 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2019-09-10 02:25:25,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:25:25,753 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2019-09-10 02:25:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:25,754 INFO L225 Difference]: With dead ends: 135 [2019-09-10 02:25:25,754 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 02:25:25,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:25:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 02:25:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-10 02:25:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 02:25:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2019-09-10 02:25:25,758 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 130 [2019-09-10 02:25:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:25,759 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2019-09-10 02:25:25,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:25:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2019-09-10 02:25:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:25:25,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:25,760 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 33, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:25,760 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1709151988, now seen corresponding path program 22 times [2019-09-10 02:25:25,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:25,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:25,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:25:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:25,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:26,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:26,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:26,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:26,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:26,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:26,567 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-10 02:25:26,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:25:26,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:25:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:26,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-10 02:25:26,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:26,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:32,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:32,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 37] total 72 [2019-09-10 02:25:32,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:32,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:25:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:25:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1401, Invalid=3711, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:25:32,288 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 37 states. [2019-09-10 02:25:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:34,967 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-09-10 02:25:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:25:34,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2019-09-10 02:25:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:34,969 INFO L225 Difference]: With dead ends: 138 [2019-09-10 02:25:34,970 INFO L226 Difference]: Without dead ends: 138 [2019-09-10 02:25:34,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 229 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1401, Invalid=3711, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:25:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-10 02:25:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-10 02:25:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-10 02:25:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-09-10 02:25:34,974 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 133 [2019-09-10 02:25:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:34,974 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-09-10 02:25:34,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:25:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-09-10 02:25:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:25:34,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:34,975 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 34, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:34,975 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash -127188713, now seen corresponding path program 23 times [2019-09-10 02:25:34,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:34,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:34,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:25:34,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:34,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 797 proven. 1751 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:25:35,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:35,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:35,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:35,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:35,892 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-10 02:25:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:25:35,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:25:35,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:25:35,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:25:35,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:25:35,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 875 proven. 100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-10 02:25:36,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 875 proven. 100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-10 02:25:37,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 12, 12] total 57 [2019-09-10 02:25:37,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:37,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:25:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:25:37,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=2301, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:25:37,080 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 47 states. [2019-09-10 02:25:41,829 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod c_main_~x~0 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-10 02:25:58,991 WARN L188 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:26:16,828 WARN L188 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-10 02:26:19,052 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-10 02:26:27,379 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:26:30,599 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:26:35,764 WARN L188 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:26:44,133 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:26:56,418 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:27:10,655 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-10 02:27:51,084 WARN L188 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:28:02,480 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-10 02:28:07,335 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:28:30,209 WARN L188 SmtUtils]: Spent 4.80 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-10 02:28:34,050 WARN L188 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:28:37,542 WARN L188 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-10 02:28:43,220 WARN L188 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:28:54,658 WARN L188 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-10 02:28:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:28:54,663 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2019-09-10 02:28:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 02:28:54,663 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-10 02:28:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:28:54,665 INFO L225 Difference]: With dead ends: 174 [2019-09-10 02:28:54,665 INFO L226 Difference]: Without dead ends: 174 [2019-09-10 02:28:54,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 171.7s TimeCoverageRelationStatistics Valid=2185, Invalid=4442, Unknown=23, NotChecked=322, Total=6972 [2019-09-10 02:28:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-10 02:28:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 143. [2019-09-10 02:28:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 02:28:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2019-09-10 02:28:54,669 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 136 [2019-09-10 02:28:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:28:54,670 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2019-09-10 02:28:54,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:28:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2019-09-10 02:28:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:28:54,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:28:54,671 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:28:54,671 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:28:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:28:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 709301369, now seen corresponding path program 24 times [2019-09-10 02:28:54,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:28:54,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:54,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:28:54,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:54,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:28:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:28:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 927 proven. 1855 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:28:55,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:28:55,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:28:55,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:28:55,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:28:55,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:28:55,551 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-10 02:28:55,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:28:55,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:28:55,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:28:55,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:28:55,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-10 02:28:55,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 333 proven. 2542 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:28:56,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 333 proven. 2542 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:29:04,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:04,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 44, 45] total 88 [2019-09-10 02:29:04,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:04,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:29:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:29:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2059, Invalid=5597, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:29:04,925 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 45 states. [2019-09-10 02:29:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:09,089 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2019-09-10 02:29:09,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:29:09,090 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 142 [2019-09-10 02:29:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:09,091 INFO L225 Difference]: With dead ends: 165 [2019-09-10 02:29:09,091 INFO L226 Difference]: Without dead ends: 165 [2019-09-10 02:29:09,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2059, Invalid=5597, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:29:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-10 02:29:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-10 02:29:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 02:29:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2019-09-10 02:29:09,097 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 142 [2019-09-10 02:29:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:09,097 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2019-09-10 02:29:09,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:29:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2019-09-10 02:29:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:29:09,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:09,098 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 42, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:09,099 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1865808618, now seen corresponding path program 25 times [2019-09-10 02:29:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:09,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:29:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:09,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:29:10,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:10,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:10,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:10,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:10,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:10,249 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-10 02:29:10,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:10,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:29:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:10,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 02:29:10,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:29:10,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:29:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:16,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 46] total 90 [2019-09-10 02:29:16,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:16,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:29:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:29:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:29:16,993 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 46 states. [2019-09-10 02:29:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:21,388 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-09-10 02:29:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 02:29:21,388 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 163 [2019-09-10 02:29:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:21,390 INFO L225 Difference]: With dead ends: 168 [2019-09-10 02:29:21,390 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 02:29:21,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:29:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 02:29:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-10 02:29:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 02:29:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2019-09-10 02:29:21,396 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 163 [2019-09-10 02:29:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:21,396 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2019-09-10 02:29:21,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:29:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2019-09-10 02:29:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:29:21,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:21,397 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 43, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:21,398 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash -823947271, now seen corresponding path program 26 times [2019-09-10 02:29:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:21,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1135 proven. 2795 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:29:22,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:22,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:22,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:22,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:22,756 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-10 02:29:22,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:29:22,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:29:22,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:29:22,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:29:22,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:29:22,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 126 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2019-09-10 02:29:23,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 126 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2019-09-10 02:29:24,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:24,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 13, 13] total 68 [2019-09-10 02:29:24,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:24,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:29:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:29:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1200, Invalid=3356, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:29:24,375 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 57 states. [2019-09-10 02:29:53,562 WARN L188 SmtUtils]: Spent 10.25 s on a formula simplification. DAG size of input: 46 DAG size of output: 10 [2019-09-10 02:30:08,941 WARN L188 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-10 02:30:37,718 WARN L188 SmtUtils]: Spent 9.78 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-10 02:30:54,516 WARN L188 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 36 DAG size of output: 12