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/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:10:54,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:10:54,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:10:54,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:10:54,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:10:54,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:10:54,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:10:54,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:10:54,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:10:54,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:10:54,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:10:54,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:10:54,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:10:54,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:10:54,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:10:54,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:10:54,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:10:54,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:10:54,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:10:54,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:10:54,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:10:54,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:10:54,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:10:54,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:10:54,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:10:54,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:10:54,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:10:54,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:10:54,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:10:54,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:10:54,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:10:54,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:10:54,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:10:54,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:10:54,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:10:54,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:10:54,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:10:54,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:10:54,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:10:54,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:10:54,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:10:54,603 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 03:10:54,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:10:54,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:10:54,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:10:54,619 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:10:54,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:10:54,620 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:10:54,620 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:10:54,620 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:10:54,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:10:54,620 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:10:54,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:10:54,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:10:54,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:10:54,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:10:54,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:10:54,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:10:54,623 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:10:54,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:10:54,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:10:54,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:10:54,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:10:54,624 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:10:54,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:10:54,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:10:54,625 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:10:54,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:10:54,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:10:54,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:10:54,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:10:54,670 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:10:54,672 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2019-09-10 03:10:54,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac3e125b/44013017f61a41b7affefe3dc98a997a/FLAG25d4bac3d [2019-09-10 03:10:55,147 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:10:55,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2019-09-10 03:10:55,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac3e125b/44013017f61a41b7affefe3dc98a997a/FLAG25d4bac3d [2019-09-10 03:10:55,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac3e125b/44013017f61a41b7affefe3dc98a997a [2019-09-10 03:10:55,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:10:55,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:10:55,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:55,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:10:55,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:10:55,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce4c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55, skipping insertion in model container [2019-09-10 03:10:55,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:10:55,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:10:55,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:55,782 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:10:55,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:55,806 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:10:55,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55 WrapperNode [2019-09-10 03:10:55,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:55,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:10:55,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:10:55,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:10:55,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (1/1) ... [2019-09-10 03:10:55,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:10:55,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:10:55,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:10:55,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:10:55,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (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 03:10:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:10:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:10:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-09-10 03:10:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:10:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:10:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-09-10 03:10:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:10:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:10:55,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:10:56,120 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:10:56,121 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:10:56,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:56 BoogieIcfgContainer [2019-09-10 03:10:56,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:10:56,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:10:56,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:10:56,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:10:56,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:10:55" (1/3) ... [2019-09-10 03:10:56,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f213e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:56, skipping insertion in model container [2019-09-10 03:10:56,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:55" (2/3) ... [2019-09-10 03:10:56,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f213e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:56, skipping insertion in model container [2019-09-10 03:10:56,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:56" (3/3) ... [2019-09-10 03:10:56,130 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2019-09-10 03:10:56,138 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:10:56,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:10:56,158 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:10:56,184 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:10:56,184 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:10:56,185 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:10:56,185 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:10:56,185 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:10:56,185 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:10:56,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:10:56,185 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:10:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:10:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:10:56,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:56,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:56,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2019-09-10 03:10:56,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:56,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:56,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:56,377 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 03:10:56,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:10:56,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:10:56,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:10:56,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:10:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:10:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:10:56,408 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:10:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:56,655 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-10 03:10:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:10:56,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:10:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:56,675 INFO L225 Difference]: With dead ends: 22 [2019-09-10 03:10:56,676 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:10:56,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:10:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:10:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:10:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:10:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:10:56,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:10:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:56,728 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:10:56,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:10:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:10:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:10:56,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:56,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:56,733 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2019-09-10 03:10:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:56,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:56,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:10:56,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:56,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:56,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:10:56,847 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:10:56,879 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:10:56,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:10:56,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:10:57,000 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 2 different actions 4 times. Widened at 1 different actions 4 times. Performed 85 root evaluator evaluations with a maximum evaluation depth of 5. Performed 85 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2019-09-10 03:10:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:57,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:10:57,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:57,005 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 03:10:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:57,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:57,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:10:57,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:10:57,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:10:57,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:57,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-09-10 03:10:57,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:57,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:10:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:10:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:10:57,344 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-10 03:10:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:57,421 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-10 03:10:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:10:57,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 03:10:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:57,423 INFO L225 Difference]: With dead ends: 21 [2019-09-10 03:10:57,423 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:10:57,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:10:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:10:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:10:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:10:57,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:10:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:57,433 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:10:57,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:10:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:10:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:10:57,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:57,435 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:57,435 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2019-09-10 03:10:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:57,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:57,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:10:57,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:57,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:57,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:57,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:57,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:57,518 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 03:10:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:57,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:57,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:10:57,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:57,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:10:57,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:10:57,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 03:10:57,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:57,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-09-10 03:10:57,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:57,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:10:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:10:57,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:57,955 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-09-10 03:10:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:58,047 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-10 03:10:58,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:10:58,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 03:10:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:58,049 INFO L225 Difference]: With dead ends: 24 [2019-09-10 03:10:58,049 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:10:58,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:10:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:10:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:10:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:10:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:10:58,061 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:10:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:10:58,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:10:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:10:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:10:58,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:58,065 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:58,066 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2019-09-10 03:10:58,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:10:58,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:58,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:58,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:58,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:10:58,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:58,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:58,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:58,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:58,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:10:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:10:58,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:58,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:58,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:10:58,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:58,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-09-10 03:10:58,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:58,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:10:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:10:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:10:58,798 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-09-10 03:10:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:58,876 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-10 03:10:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:10:58,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-10 03:10:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:58,878 INFO L225 Difference]: With dead ends: 27 [2019-09-10 03:10:58,878 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:10:58,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:10:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:10:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:10:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:10:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:10:58,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:10:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:58,884 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:10:58,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:10:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:10:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:10:58,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:58,886 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:58,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:58,887 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2019-09-10 03:10:58,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:10:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:58,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:58,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:58,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:58,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:59,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:10:59,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:10:59,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:59,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:10:59,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:59,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-09-10 03:10:59,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:59,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:10:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:10:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:10:59,916 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-09-10 03:11:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:00,027 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-09-10 03:11:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:11:00,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 03:11:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:00,028 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:11:00,029 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:11:00,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:11:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:11:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:11:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:11:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:11:00,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:11:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:00,035 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:11:00,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:11:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:11:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:11:00,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:00,036 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:00,036 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2019-09-10 03:11:00,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:00,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:00,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:11:00,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:00,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:00,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:00,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:00,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:00,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:00,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:11:00,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:11:00,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:00,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 03:11:00,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:11:00,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:11:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-09-10 03:11:01,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:01,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:11:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:11:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:11:01,416 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-09-10 03:11:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:01,529 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-10 03:11:01,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:11:01,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-10 03:11:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:01,531 INFO L225 Difference]: With dead ends: 33 [2019-09-10 03:11:01,531 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:11:01,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:11:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:11:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:11:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:11:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:11:01,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:11:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:01,541 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:11:01,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:11:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:11:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:11:01,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:01,543 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:01,543 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2019-09-10 03:11:01,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:01,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:01,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:11:01,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:01,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:01,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:01,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:01,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:01,718 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 03:11:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:11:01,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:11:01,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:11:01,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:01,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:11:01,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:11:01,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:02,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:11:03,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:03,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-09-10 03:11:03,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:03,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:11:03,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:11:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:11:03,704 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-09-10 03:11:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:03,854 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-09-10 03:11:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:11:03,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-10 03:11:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:03,855 INFO L225 Difference]: With dead ends: 36 [2019-09-10 03:11:03,856 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:11:03,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:11:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:11:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:11:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:11:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:11:03,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:11:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:03,862 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:11:03,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:11:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:11:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:11:03,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:03,864 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:03,864 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:03,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2019-09-10 03:11:03,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:03,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:03,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:03,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:03,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:11:04,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:04,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:04,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:04,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:04,008 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 03:11:04,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:04,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:11:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:04,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:11:04,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:11:04,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:11:06,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-09-10 03:11:06,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:06,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:11:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:11:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:11:06,936 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-09-10 03:11:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:07,077 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-09-10 03:11:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:11:07,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 03:11:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:07,079 INFO L225 Difference]: With dead ends: 39 [2019-09-10 03:11:07,079 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:11:07,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:11:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:11:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:11:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:11:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:11:07,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:11:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:07,096 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:11:07,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:11:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:11:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:11:07,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:07,097 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:07,098 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2019-09-10 03:11:07,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:07,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:11:07,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:07,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:07,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:07,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:07,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:07,262 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 03:11:07,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:07,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:11:07,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:11:07,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:07,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:11:07,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:11:07,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:11,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:11,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:11,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:11,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 03:11:11,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:11,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-09-10 03:11:11,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:11,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:11:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:11:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:11:11,327 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-09-10 03:11:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:11,465 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-10 03:11:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:11:11,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 03:11:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:11,466 INFO L225 Difference]: With dead ends: 42 [2019-09-10 03:11:11,466 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:11:11,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:11:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:11:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:11:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:11:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:11:11,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:11:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:11,473 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:11:11,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:11:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:11:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:11:11,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:11,475 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:11,475 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2019-09-10 03:11:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:11,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:11,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:11:11,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:11,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:11,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:11,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:11,595 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 03:11:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:11:11,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:11:11,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:11:11,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:11,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 03:11:11,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:11:11,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:16,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:16,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:11:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-09-10 03:11:17,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:17,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:11:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:11:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:11:17,076 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2019-09-10 03:11:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:17,268 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-09-10 03:11:17,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:11:17,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-09-10 03:11:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:17,274 INFO L225 Difference]: With dead ends: 45 [2019-09-10 03:11:17,274 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:11:17,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:11:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:11:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:11:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:11:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:11:17,282 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:11:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:17,282 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:11:17,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:11:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:11:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:11:17,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:17,285 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:17,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2019-09-10 03:11:17,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:17,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:17,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:17,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:17,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:11:17,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:17,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:17,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:17,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:17,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:17,451 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 03:11:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:17,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:11:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:17,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:11:17,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:11:17,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:21,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:22,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 03:11:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:24,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-09-10 03:11:24,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:24,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:11:24,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:11:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:11:24,732 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2019-09-10 03:11:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:24,893 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-09-10 03:11:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:11:24,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-10 03:11:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:24,896 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:11:24,896 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:11:24,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:11:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:11:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 03:11:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:11:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:11:24,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-10 03:11:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:24,902 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:11:24,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:11:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:11:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:11:24,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:24,904 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:24,904 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2019-09-10 03:11:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:24,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:11:25,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:25,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:25,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:25,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:25,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:25,103 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 03:11:25,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:25,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:11:25,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:11:25,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:25,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 03:11:25,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:11:25,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:30,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 03:11:34,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:34,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-09-10 03:11:34,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:34,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:11:34,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:11:34,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:11:34,975 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2019-09-10 03:11:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:35,206 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-09-10 03:11:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 03:11:35,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-10 03:11:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:35,207 INFO L225 Difference]: With dead ends: 51 [2019-09-10 03:11:35,207 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:11:35,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:11:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:11:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 03:11:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:11:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:11:35,215 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-10 03:11:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:35,215 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:11:35,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:11:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:11:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:11:35,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:35,216 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:35,217 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2019-09-10 03:11:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:35,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:35,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:11:35,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:35,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:35,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:35,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:35,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:35,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:11:35,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:11:35,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:11:35,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:35,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:11:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:11:35,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:40,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:43,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:44,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 03:11:47,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:47,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-09-10 03:11:47,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:47,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:11:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:11:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:11:47,651 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2019-09-10 03:11:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:47,896 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-09-10 03:11:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:11:47,897 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 03:11:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:47,898 INFO L225 Difference]: With dead ends: 54 [2019-09-10 03:11:47,898 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:11:47,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:11:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:11:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 03:11:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:11:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:11:47,905 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-10 03:11:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:47,905 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:11:47,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:11:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:11:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:11:47,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:47,907 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:11:47,907 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2019-09-10 03:11:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:47,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:47,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:11:48,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:48,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:48,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:48,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:11:48,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:48,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:11:48,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:48,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:48,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 03:11:48,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:11:48,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:53,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:56,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:58,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:59,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:00,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:01,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:02,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:02,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:03,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-10 03:12:03,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:03,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-09-10 03:12:03,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:03,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:12:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:12:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:12:03,464 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2019-09-10 03:12:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:03,721 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-09-10 03:12:03,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:12:03,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 03:12:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:03,723 INFO L225 Difference]: With dead ends: 57 [2019-09-10 03:12:03,723 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:12:03,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:12:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:12:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 03:12:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:12:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:12:03,731 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-10 03:12:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:03,731 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:12:03,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:12:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:12:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:12:03,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:03,733 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:03,733 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2019-09-10 03:12:03,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:03,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:03,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:03,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:03,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:12:03,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:03,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:03,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:03,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:03,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:03,918 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 03:12:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:12:03,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:12:03,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:12:03,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:12:03,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:12:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:12:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:12:03,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:10,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:17,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:18,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:20,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:21,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-10 03:12:22,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2019-09-10 03:12:22,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:22,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:12:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:12:22,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:12:22,966 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-09-10 03:12:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:23,262 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-10 03:12:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:12:23,263 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-09-10 03:12:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:23,264 INFO L225 Difference]: With dead ends: 60 [2019-09-10 03:12:23,264 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:12:23,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 30 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:12:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:12:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 03:12:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:12:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:12:23,280 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-10 03:12:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:23,281 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:12:23,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:12:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:12:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:12:23,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:23,282 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:23,284 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2019-09-10 03:12:23,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:23,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:12:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:23,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:12:23,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:23,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:23,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:23,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:23,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:23,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:12:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:12:23,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:12:23,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:12:23,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:12:23,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 03:12:23,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:12:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:12:23,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:26,755 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:12:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:34,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:36,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:40,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:44,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:45,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:45,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:46,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:46,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:46,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-10 03:12:46,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:46,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2019-09-10 03:12:46,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:46,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:12:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:12:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:12:46,368 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2019-09-10 03:12:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:46,726 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-09-10 03:12:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:12:46,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-10 03:12:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:46,729 INFO L225 Difference]: With dead ends: 63 [2019-09-10 03:12:46,729 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 03:12:46,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 32 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:12:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 03:12:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-10 03:12:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 03:12:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-10 03:12:46,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2019-09-10 03:12:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:46,747 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-10 03:12:46,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:12:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-10 03:12:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:12:46,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:46,754 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:46,754 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:46,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2019-09-10 03:12:46,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:46,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:46,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:12:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:46,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:12:47,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:47,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:47,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:47,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:47,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:47,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:12:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:47,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:12:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:47,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 03:12:47,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:12:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:12:47,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:49,173 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-10 03:12:50,022 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:12:50,237 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:12:50,349 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:12:50,461 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 03:12:50,571 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 03:12:50,686 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:12:50,791 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:12:50,894 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-10 03:12:54,852 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:12:54,956 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:12:55,066 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:12:55,169 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:12:56,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:00,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:03,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:10,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:11,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:12,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:14,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:14,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:15,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:13:15,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:13:15,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2019-09-10 03:13:15,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:13:15,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:13:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:13:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 03:13:15,359 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2019-09-10 03:13:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:15,681 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-10 03:13:15,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:13:15,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-09-10 03:13:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:15,683 INFO L225 Difference]: With dead ends: 66 [2019-09-10 03:13:15,683 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 03:13:15,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:13:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 03:13:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 03:13:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 03:13:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 03:13:15,690 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2019-09-10 03:13:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:15,690 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 03:13:15,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:13:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 03:13:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 03:13:15,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:15,692 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:15,692 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:15,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2019-09-10 03:13:15,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:15,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:15,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:13:15,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:13:15,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:13:15,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:13:15,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:13:15,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:13:15,950 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 03:13:15,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:13:15,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:13:16,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:13:16,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:13:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 03:13:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:13:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:13:16,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:13:18,339 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-10 03:13:19,006 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:19,120 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:19,228 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:19,341 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:19,460 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:19,574 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:13:19,686 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:13:19,808 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 03:13:19,931 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 03:13:20,051 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-09-10 03:13:20,162 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-09-10 03:13:20,271 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-10 03:13:20,375 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 03:13:20,477 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-10 03:13:24,471 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:13:24,674 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:24,776 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:24,893 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:25,001 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:25,116 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:25,227 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:25,341 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:13:25,447 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:13:25,550 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 03:13:26,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:29,493 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:13:29,691 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:29,801 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:31,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:37,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:40,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:42,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:45,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:46,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:47,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:48,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:13:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-10 03:13:49,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:13:49,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2019-09-10 03:13:49,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:13:49,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:13:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:13:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:13:49,609 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2019-09-10 03:13:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:49,947 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-09-10 03:13:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 03:13:49,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-09-10 03:13:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:49,950 INFO L225 Difference]: With dead ends: 69 [2019-09-10 03:13:49,950 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 03:13:49,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 193 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 03:13:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 03:13:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-10 03:13:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 03:13:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-10 03:13:49,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2019-09-10 03:13:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:49,957 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-10 03:13:49,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:13:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-10 03:13:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 03:13:49,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:49,958 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:49,959 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2019-09-10 03:13:49,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:49,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:13:49,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:49,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:13:50,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:13:50,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:13:50,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:13:50,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:13:50,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:13:50,202 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 03:13:50,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:13:50,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:13:50,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:13:50,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:13:50,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 03:13:50,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:13:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:13:50,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:13:53,015 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:53,223 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:53,324 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:53,443 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:53,555 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:53,675 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:13:53,784 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:13:53,898 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:13:54,019 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:13:54,145 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:13:54,270 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:13:54,400 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-10 03:13:54,530 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-10 03:13:54,652 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-10 03:13:54,772 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-10 03:13:54,886 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-09-10 03:13:54,994 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 03:13:55,100 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 03:13:55,202 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-10 03:13:55,403 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-09-10 03:13:59,451 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:13:59,561 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:13:59,772 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:59,877 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:13:59,991 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:00,101 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:00,216 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:00,335 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:00,452 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:14:00,559 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:14:00,671 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:14:00,776 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:14:01,168 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-09-10 03:14:02,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:04,584 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-10 03:14:04,879 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:14:05,082 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:05,186 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:05,294 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:05,401 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:09,675 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:14:11,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:22,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:24,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:25,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:27,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:28,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-10 03:14:29,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:14:29,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2019-09-10 03:14:29,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:14:29,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 03:14:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 03:14:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:14:29,537 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2019-09-10 03:14:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:29,937 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-10 03:14:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:14:29,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2019-09-10 03:14:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:29,939 INFO L225 Difference]: With dead ends: 72 [2019-09-10 03:14:29,939 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 03:14:29,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:14:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 03:14:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-10 03:14:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:14:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-10 03:14:29,944 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2019-09-10 03:14:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:29,945 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-10 03:14:29,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 03:14:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-10 03:14:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 03:14:29,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:29,946 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:29,946 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2019-09-10 03:14:29,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:29,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:14:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:29,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:14:30,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:30,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:14:30,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:14:30,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:14:30,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:30,229 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 03:14:30,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:14:30,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:14:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:30,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 03:14:30,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:14:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:14:30,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:14:32,686 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-10 03:14:32,884 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:14:33,283 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:33,385 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:33,491 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:33,601 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:33,718 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:33,839 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:33,958 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:34,075 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:34,203 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:14:34,327 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:14:34,464 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:14:34,599 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:14:34,737 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:14:34,874 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:14:35,039 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-10 03:14:35,189 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-10 03:14:35,333 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-09-10 03:14:35,466 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-10 03:14:35,597 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-10 03:14:35,723 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-09-10 03:14:35,842 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-09-10 03:14:35,958 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:14:36,075 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:14:36,186 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 03:14:36,289 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-10 03:14:40,301 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:14:40,701 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:40,809 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:40,918 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:41,038 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:41,156 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:41,273 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:41,390 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:41,528 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:14:41,654 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:14:41,785 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:14:41,914 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:14:42,042 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 03:14:42,164 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-09-10 03:14:42,276 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-09-10 03:14:42,387 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-09-10 03:14:42,493 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-10 03:14:42,594 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 03:14:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:46,871 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:46,976 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:47,089 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:47,193 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:47,319 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:47,428 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:14:47,549 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:47,666 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:14:47,784 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:14:47,892 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:14:48,003 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:14:48,104 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:14:49,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:52,178 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:14:52,381 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:14:52,594 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:52,704 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:14:52,812 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:14:53,014 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 03:14:54,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:14:58,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:02,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:05,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:09,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:11,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:12,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:15,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:15:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-10 03:15:16,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:15:16,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 44 [2019-09-10 03:15:16,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:15:16,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 03:15:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 03:15:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:15:16,729 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2019-09-10 03:15:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:17,068 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-09-10 03:15:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 03:15:17,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-10 03:15:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:17,070 INFO L225 Difference]: With dead ends: 75 [2019-09-10 03:15:17,070 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 03:15:17,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 213 SyntacticMatches, 41 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1365, Invalid=2667, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 03:15:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 03:15:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 03:15:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 03:15:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-10 03:15:17,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2019-09-10 03:15:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:17,077 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-10 03:15:17,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 03:15:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-10 03:15:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:15:17,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:17,078 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:17,078 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2019-09-10 03:15:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:17,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:15:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:15:17,179 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:15:17,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:15:17 BoogieIcfgContainer [2019-09-10 03:15:17,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:15:17,227 INFO L168 Benchmark]: Toolchain (without parser) took 261674.50 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 90.2 MB in the beginning and 163.8 MB in the end (delta: -73.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,227 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.53 ms. Allocated memory is still 134.2 MB. Free memory was 90.0 MB in the beginning and 81.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,233 INFO L168 Benchmark]: Boogie Preprocessor took 111.31 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 81.0 MB in the beginning and 178.9 MB in the end (delta: -97.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,233 INFO L168 Benchmark]: RCFGBuilder took 203.66 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 167.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,234 INFO L168 Benchmark]: TraceAbstraction took 261101.58 ms. Allocated memory was 201.3 MB in the beginning and 256.9 MB in the end (delta: 55.6 MB). Free memory was 167.7 MB in the beginning and 163.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:15:17,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.53 ms. Allocated memory is still 134.2 MB. Free memory was 90.0 MB in the beginning and 81.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.31 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 81.0 MB in the beginning and 178.9 MB in the end (delta: -97.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 203.66 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 167.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261101.58 ms. Allocated memory was 201.3 MB in the beginning and 256.9 MB in the end (delta: 55.6 MB). Free memory was 167.7 MB in the beginning and 163.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; VAL [a=20, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=20, b=0, sum(a, b)=20] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=20, b=0, result=20] [L16] __VERIFIER_error() VAL [a=20, b=0, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 261.0s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 523 SDslu, 1862 SDs, 0 SdLazy, 1445 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3445 GetRequests, 2339 SyntacticMatches, 419 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8339 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 254.3s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 4116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045392 SizeOfPredicates, 228 NumberOfNonLiveVariables, 4123 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 8930/22800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...