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/loop-acceleration/functions_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:37:16,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:16,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:16,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:16,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:16,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:16,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:16,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:16,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:16,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:16,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:16,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:16,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:16,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:16,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:16,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:16,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:16,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:16,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:16,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:16,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:16,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:16,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:16,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:16,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:16,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:16,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:16,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:16,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:16,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:16,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:16,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:16,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:16,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:16,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:16,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:16,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:16,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:16,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:16,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:16,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:16,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:37:16,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:16,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:16,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:16,732 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:16,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:16,732 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:16,733 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:16,733 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:16,733 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:16,733 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:16,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:16,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:16,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:16,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:16,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:16,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:16,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:16,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:16,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:16,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:16,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:16,736 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:16,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:16,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:16,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:16,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:16,737 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:16,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:16,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:16,738 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:16,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:16,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:16,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:16,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:16,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:16,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2019-09-03 20:37:16,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b948adf7/ee2258e6a894449783be6a0f913fedcb/FLAG5c0deaf20 [2019-09-03 20:37:17,271 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:17,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2019-09-03 20:37:17,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b948adf7/ee2258e6a894449783be6a0f913fedcb/FLAG5c0deaf20 [2019-09-03 20:37:17,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b948adf7/ee2258e6a894449783be6a0f913fedcb [2019-09-03 20:37:17,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:17,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:17,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:17,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:17,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:17,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17, skipping insertion in model container [2019-09-03 20:37:17,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,699 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:17,719 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:17,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:17,855 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:17,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:17,881 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:17,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17 WrapperNode [2019-09-03 20:37:17,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:17,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:17,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:17,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:17,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:17,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:17,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:17,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:17,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-09-03 20:37:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-09-03 20:37:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:18,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:18,188 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:37:18,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18 BoogieIcfgContainer [2019-09-03 20:37:18,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:18,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:18,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:18,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:18,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:17" (1/3) ... [2019-09-03 20:37:18,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7618c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (2/3) ... [2019-09-03 20:37:18,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7618c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18" (3/3) ... [2019-09-03 20:37:18,218 INFO L109 eAbstractionObserver]: Analyzing ICFG functions_1-1.c [2019-09-03 20:37:18,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:18,252 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:18,272 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:18,322 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:18,322 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:18,323 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:18,323 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:18,323 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:18,323 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:18,323 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:18,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-03 20:37:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:18,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,358 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1238725826, now seen corresponding path program 1 times [2019-09-03 20:37:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:37:18,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:18,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:37:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:37:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:18,491 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-03 20:37:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,504 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:37:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:37:18,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:37:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,514 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:18,514 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:37:18,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:37:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:37:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:37:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:37:18,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-09-03 20:37:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,553 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:37:18,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:37:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:37:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:18,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1244266952, now seen corresponding path program 1 times [2019-09-03 20:37:18,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:18,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:18,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:18,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:18,718 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-09-03 20:37:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,742 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:37:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:18,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,744 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:37:18,745 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:37:18,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:37:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-03 20:37:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:37:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:37:18,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2019-09-03 20:37:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,764 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:37:18,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:37:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:37:18,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,766 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1831198934, now seen corresponding path program 1 times [2019-09-03 20:37:18,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:18,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:18,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 20:37:18,942 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [13], [15], [17], [23], [26], [28], [34], [35], [36], [38], [39], [40] [2019-09-03 20:37:18,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:18,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:19,040 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:19,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:19,548 INFO L272 AbstractInterpreter]: Visited 16 different actions 71 times. Merged at 4 different actions 20 times. Widened at 1 different actions 3 times. Performed 92 root evaluator evaluations with a maximum evaluation depth of 13. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-03 20:37:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:19,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,555 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) [2019-09-03 20:37:19,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:19,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:19,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:19,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:19,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:19,869 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-09-03 20:37:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,953 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-03 20:37:19,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:19,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 20:37:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,955 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:19,955 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:37:19,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:37:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:37:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-03 20:37:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:37:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 20:37:19,961 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-03 20:37:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,962 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 20:37:19,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 20:37:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:37:19,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,965 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 329045236, now seen corresponding path program 2 times [2019-09-03 20:37:19,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:20,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:20,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:20,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:20,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,177 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-03 20:37:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:20,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:20,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:20,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:20,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:37:20,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 20:37:20,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:37:20,582 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-03 20:37:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:20,715 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-03 20:37:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:20,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 20:37:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:20,717 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:37:20,717 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:37:20,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:37:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:37:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-09-03 20:37:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:37:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:37:20,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 22 [2019-09-03 20:37:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:20,726 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:37:20,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:37:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:37:20,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:20,728 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:20,728 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 755481234, now seen corresponding path program 3 times [2019-09-03 20:37:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:37:20,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:20,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:20,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:20,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:20,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:20,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:20,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:20,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:37:21,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:21,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:21,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 21 [2019-09-03 20:37:21,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:21,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:21,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:21,424 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-09-03 20:37:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:21,603 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-03 20:37:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:21,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-03 20:37:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:21,607 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:37:21,608 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:37:21,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:37:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:37:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-03 20:37:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:37:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-03 20:37:21,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 28 [2019-09-03 20:37:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:21,617 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-03 20:37:21,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-03 20:37:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:37:21,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:21,624 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:21,624 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1475645008, now seen corresponding path program 4 times [2019-09-03 20:37:21,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:21,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:37:21,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:21,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:21,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:21,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:21,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:37:21,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:37:21,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:37:22,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:22,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 26 [2019-09-03 20:37:22,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:22,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:37:22,431 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-03 20:37:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:22,645 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-03 20:37:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:37:22,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-03 20:37:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:22,647 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:37:22,647 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:37:22,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:37:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:37:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-03 20:37:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:37:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 20:37:22,655 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2019-09-03 20:37:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:22,656 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 20:37:22,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 20:37:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:37:22,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:22,658 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:22,658 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1545919054, now seen corresponding path program 5 times [2019-09-03 20:37:22,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:37:22,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:22,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:22,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:22,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:22,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:22,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:22,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:22,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:37:22,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:37:23,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-03 20:37:23,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:23,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 31 [2019-09-03 20:37:23,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:23,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:37:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:37:23,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:23,684 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2019-09-03 20:37:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,989 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-09-03 20:37:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:37:23,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-03 20:37:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,990 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:37:23,990 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:37:23,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:37:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:37:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-03 20:37:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:37:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-03 20:37:23,997 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2019-09-03 20:37:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,997 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-03 20:37:23,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:37:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-03 20:37:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:37:23,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,999 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,999 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 128504940, now seen corresponding path program 6 times [2019-09-03 20:37:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:37:24,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:24,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:24,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:24,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:24,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:24,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:24,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:24,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:24,278 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:37:24,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:37:24,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:37:25,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:25,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 21] total 36 [2019-09-03 20:37:25,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:25,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:37:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:37:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:37:25,145 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 17 states. [2019-09-03 20:37:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,557 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-03 20:37:25,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:37:25,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-03 20:37:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,562 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:37:25,563 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:37:25,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:37:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:37:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:37:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:37:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-09-03 20:37:25,569 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2019-09-03 20:37:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,570 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-09-03 20:37:25,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:37:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-09-03 20:37:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:37:25,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,571 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,572 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,572 INFO L82 PathProgramCache]: Analyzing trace with hash -842776566, now seen corresponding path program 7 times [2019-09-03 20:37:25,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 20:37:25,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,835 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-03 20:37:25,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:25,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 20:37:25,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-03 20:37:26,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 24] total 41 [2019-09-03 20:37:26,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:37:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:37:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:37:26,954 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2019-09-03 20:37:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:27,443 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-09-03 20:37:27,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:37:27,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-03 20:37:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:27,445 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:37:27,445 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:37:27,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:37:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:37:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-09-03 20:37:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:37:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-03 20:37:27,452 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2019-09-03 20:37:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:27,453 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-03 20:37:27,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:37:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-03 20:37:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:37:27,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:27,454 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:27,454 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 880540968, now seen corresponding path program 8 times [2019-09-03 20:37:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:27,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:27,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:27,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:27,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,769 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-03 20:37:27,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:27,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:42,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:37:42,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:42,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:37:42,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:42,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 20:37:43,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:43,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 27] total 46 [2019-09-03 20:37:43,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:43,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:37:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:37:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:37:43,498 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 21 states. [2019-09-03 20:37:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:44,108 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-03 20:37:44,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:37:44,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-09-03 20:37:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:44,110 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:37:44,110 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:37:44,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 81 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:37:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:37:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-03 20:37:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:37:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-03 20:37:44,117 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 58 [2019-09-03 20:37:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:44,118 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-03 20:37:44,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:37:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-03 20:37:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:37:44,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:44,119 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:44,119 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1565725754, now seen corresponding path program 9 times [2019-09-03 20:37:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:44,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:44,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:44,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:44,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-03 20:37:44,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:44,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:44,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:44,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:44,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:44,470 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-03 20:37:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:44,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:44,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:44,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:44,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:37:44,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-03 20:37:44,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:37:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:45,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 30] total 51 [2019-09-03 20:37:45,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:45,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:37:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:37:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2241, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:37:45,942 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 23 states. [2019-09-03 20:37:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:46,634 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-03 20:37:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:37:46,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-09-03 20:37:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:46,636 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:37:46,636 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:37:46,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 89 SyntacticMatches, 20 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=525, Invalid=3015, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:37:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:37:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-03 20:37:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-03 20:37:46,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 64 [2019-09-03 20:37:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:46,648 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-03 20:37:46,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:37:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-03 20:37:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:37:46,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:46,650 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:46,650 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1577839588, now seen corresponding path program 10 times [2019-09-03 20:37:46,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:46,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:46,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-03 20:37:47,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:47,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:47,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:47,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:47,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:47,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:47,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:47,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:47,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 20:37:47,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-03 20:37:47,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:37:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 33] total 56 [2019-09-03 20:37:48,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:48,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:37:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:37:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:37:48,984 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 25 states. [2019-09-03 20:37:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:49,850 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-09-03 20:37:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:37:49,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2019-09-03 20:37:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:49,852 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:37:49,852 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:37:49,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 97 SyntacticMatches, 22 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=622, Invalid=3668, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:37:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:37:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-03 20:37:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:37:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-09-03 20:37:49,859 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 70 [2019-09-03 20:37:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:49,860 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-09-03 20:37:49,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:37:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-09-03 20:37:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:37:49,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:49,862 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:49,862 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 153476482, now seen corresponding path program 11 times [2019-09-03 20:37:49,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:49,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:49,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-03 20:37:50,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:50,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:50,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:50,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:50,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:50,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:50,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:50,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:14,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:39:14,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:15,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 20:39:15,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-03 20:39:16,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 280 refuted. 6 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-03 20:40:24,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:24,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 37] total 62 [2019-09-03 20:40:24,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:24,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:40:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:40:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3323, Unknown=24, NotChecked=0, Total=3782 [2019-09-03 20:40:24,649 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 27 states. [2019-09-03 20:40:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:25,821 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-09-03 20:40:25,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:40:25,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2019-09-03 20:40:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:25,823 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:40:25,823 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:40:25,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 103 SyntacticMatches, 25 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 69.2s TimeCoverageRelationStatistics Valid=754, Invalid=4478, Unknown=24, NotChecked=0, Total=5256 [2019-09-03 20:40:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:40:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-03 20:40:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:40:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-09-03 20:40:25,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 76 [2019-09-03 20:40:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:25,832 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-09-03 20:40:25,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:40:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-09-03 20:40:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:40:25,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:25,834 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:25,834 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1587568480, now seen corresponding path program 12 times [2019-09-03 20:40:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:25,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:25,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 20:40:26,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:26,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:26,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:26,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:26,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:26,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:40:26,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:40:26,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:26,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:26,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 20:40:26,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 20:40:26,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:40:28,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:28,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 39] total 66 [2019-09-03 20:40:28,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:28,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:40:28,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:40:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3810, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:40:28,916 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 29 states. [2019-09-03 20:40:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:30,026 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-09-03 20:40:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:40:30,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2019-09-03 20:40:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:30,028 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:40:30,028 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:40:30,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 113 SyntacticMatches, 26 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=840, Invalid=5166, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:40:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:40:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-03 20:40:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:40:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-09-03 20:40:30,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 82 [2019-09-03 20:40:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:30,035 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-09-03 20:40:30,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:40:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-09-03 20:40:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:40:30,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:30,036 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:30,037 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:30,037 INFO L82 PathProgramCache]: Analyzing trace with hash -50981570, now seen corresponding path program 13 times [2019-09-03 20:40:30,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:30,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:30,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:30,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:30,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-03 20:40:30,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:30,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:30,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:30,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:30,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:30,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:30,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:30,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:40:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:30,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 20:40:30,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-03 20:40:30,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-03 20:40:33,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:33,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 42] total 71 [2019-09-03 20:40:33,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:33,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:40:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:40:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=4425, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:40:33,824 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 31 states. [2019-09-03 20:40:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:35,378 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-03 20:40:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:40:35,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-03 20:40:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:35,380 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:40:35,381 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:40:35,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 121 SyntacticMatches, 28 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=961, Invalid=6011, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:40:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:40:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-03 20:40:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:40:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2019-09-03 20:40:35,389 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 88 [2019-09-03 20:40:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:35,389 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-09-03 20:40:35,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:40:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2019-09-03 20:40:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:40:35,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:35,391 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:35,391 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash -922870948, now seen corresponding path program 14 times [2019-09-03 20:40:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:35,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:35,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-03 20:40:36,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:36,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:36,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:36,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:36,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:36,144 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) [2019-09-03 20:40:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:36,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:06,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:42:06,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:11,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:42:11,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-03 20:42:11,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 20:42:14,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:14,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 45] total 76 [2019-09-03 20:42:14,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:14,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:42:14,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:42:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=5086, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:42:14,580 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 33 states. [2019-09-03 20:42:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:16,042 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-09-03 20:42:16,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:42:16,042 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-03 20:42:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:16,044 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:42:16,044 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:42:16,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 129 SyntacticMatches, 30 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1090, Invalid=6920, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:42:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:42:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-03 20:42:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:42:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-09-03 20:42:16,054 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 94 [2019-09-03 20:42:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-09-03 20:42:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:42:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-09-03 20:42:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:42:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:16,056 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:16,056 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 124031738, now seen corresponding path program 15 times [2019-09-03 20:42:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:16,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:16,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-03 20:42:16,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:16,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:16,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:16,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:16,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:16,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:16,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:16,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:16,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:16,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:16,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 20:42:16,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-03 20:42:16,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-03 20:42:20,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:20,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 48] total 81 [2019-09-03 20:42:20,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:20,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:42:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:42:20,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=5793, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:42:20,441 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 35 states. [2019-09-03 20:42:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:22,079 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2019-09-03 20:42:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:42:22,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-03 20:42:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:22,081 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:42:22,082 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:42:22,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 137 SyntacticMatches, 32 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1227, Invalid=7893, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:42:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:42:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-03 20:42:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:42:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2019-09-03 20:42:22,088 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 100 [2019-09-03 20:42:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:22,088 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2019-09-03 20:42:22,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:42:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2019-09-03 20:42:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:42:22,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:22,090 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:22,090 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash 216947736, now seen corresponding path program 16 times [2019-09-03 20:42:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:22,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:22,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-03 20:42:22,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:22,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:22,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:22,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:22,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:22,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:22,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:22,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:22,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 20:42:22,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-03 20:42:22,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:42:26,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:26,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 51] total 86 [2019-09-03 20:42:26,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:26,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:42:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:42:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=6546, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:42:26,976 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 37 states. [2019-09-03 20:42:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:28,812 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2019-09-03 20:42:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:42:28,813 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-03 20:42:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:28,815 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:42:28,815 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:42:28,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 145 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1372, Invalid=8930, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:42:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:42:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-03 20:42:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:42:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-09-03 20:42:28,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 106 [2019-09-03 20:42:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:28,821 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-09-03 20:42:28,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:42:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-09-03 20:42:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:42:28,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:28,823 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:28,823 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -13085002, now seen corresponding path program 17 times [2019-09-03 20:42:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:28,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:28,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-03 20:42:29,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:29,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:29,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:29,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:29,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:29,801 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) [2019-09-03 20:42:29,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:29,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:52,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:42:52,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:52,189 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 20:42:52,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-03 20:42:52,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-03 20:42:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:57,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 54] total 91 [2019-09-03 20:42:57,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:57,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:42:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:42:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=7345, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:42:57,264 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 39 states. [2019-09-03 20:42:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:59,272 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-09-03 20:42:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:42:59,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2019-09-03 20:42:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:59,274 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:42:59,274 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:42:59,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 153 SyntacticMatches, 36 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1525, Invalid=10031, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:42:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:42:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-03 20:42:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:42:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-09-03 20:42:59,280 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 112 [2019-09-03 20:42:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:59,281 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-09-03 20:42:59,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:42:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-09-03 20:42:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:42:59,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:59,282 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:59,283 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash -759733548, now seen corresponding path program 18 times [2019-09-03 20:42:59,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:59,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:59,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-03 20:43:00,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:00,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:00,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:00,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:00,416 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) [2019-09-03 20:43:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:43:00,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:00,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:43:00,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:00,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 183 conjunts are in the unsatisfiable core [2019-09-03 20:43:00,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-03 20:43:00,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 781 refuted. 2 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-03 20:43:08,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:08,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 57] total 96 [2019-09-03 20:43:08,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:08,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:43:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:43:08,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=8189, Unknown=1, NotChecked=0, Total=9120 [2019-09-03 20:43:08,231 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 41 states. [2019-09-03 20:43:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:10,568 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2019-09-03 20:43:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:43:10,569 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-09-03 20:43:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:10,570 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:43:10,570 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:43:10,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 161 SyntacticMatches, 38 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1686, Invalid=11195, Unknown=1, NotChecked=0, Total=12882 [2019-09-03 20:43:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:43:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-09-03 20:43:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:43:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-09-03 20:43:10,575 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 118 [2019-09-03 20:43:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:10,576 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-09-03 20:43:10,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:43:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-09-03 20:43:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:43:10,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:10,577 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:10,577 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -927440782, now seen corresponding path program 19 times [2019-09-03 20:43:10,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:10,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:10,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-03 20:43:11,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:11,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:11,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:11,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:11,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:11,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:11,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:43:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:11,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 193 conjunts are in the unsatisfiable core [2019-09-03 20:43:11,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-03 20:43:11,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-03 20:43:17,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:17,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 60] total 101 [2019-09-03 20:43:17,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:17,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:43:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:43:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1019, Invalid=9081, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:43:17,744 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 43 states. [2019-09-03 20:43:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:20,305 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-09-03 20:43:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:43:20,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2019-09-03 20:43:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:20,307 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:43:20,307 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:43:20,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 169 SyntacticMatches, 40 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1855, Invalid=12425, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:43:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:43:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-03 20:43:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:43:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-09-03 20:43:20,312 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 124 [2019-09-03 20:43:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:20,312 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-09-03 20:43:20,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:43:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-09-03 20:43:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:43:20,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:20,314 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:20,314 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1835020176, now seen corresponding path program 20 times [2019-09-03 20:43:20,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:20,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:20,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-03 20:43:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:21,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:21,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:21,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:21,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:21,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:21,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:43:21,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:45:30,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:45:30,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:45:31,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 203 conjunts are in the unsatisfiable core [2019-09-03 20:45:31,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:45:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-03 20:45:31,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:45:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-03 20:45:37,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:45:37,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 63] total 106 [2019-09-03 20:45:37,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:45:37,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:45:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:45:37,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=10018, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:45:37,070 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 45 states. [2019-09-03 20:45:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:45:39,768 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2019-09-03 20:45:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:45:39,771 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2019-09-03 20:45:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:45:39,772 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:45:39,772 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:45:39,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 177 SyntacticMatches, 42 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2032, Invalid=13718, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:45:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:45:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-09-03 20:45:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:45:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2019-09-03 20:45:39,777 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 130 [2019-09-03 20:45:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:45:39,777 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2019-09-03 20:45:39,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:45:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2019-09-03 20:45:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:45:39,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:45:39,779 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:45:39,779 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:45:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:45:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash 363573294, now seen corresponding path program 21 times [2019-09-03 20:45:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:45:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:39,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:45:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:39,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:45:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:45:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:45:41,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:41,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:45:41,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:45:41,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:45:41,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:41,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:45:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:45:41,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:45:41,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:45:41,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:45:41,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 213 conjunts are in the unsatisfiable core [2019-09-03 20:45:41,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:45:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:45:41,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:45:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:45:47,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:45:47,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 66] total 111 [2019-09-03 20:45:47,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:45:47,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:45:47,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:45:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=11001, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:45:47,730 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 47 states. [2019-09-03 20:45:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:45:50,691 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-09-03 20:45:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:45:50,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-03 20:45:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:45:50,693 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:45:50,693 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:45:50,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 185 SyntacticMatches, 44 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2217, Invalid=15075, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:45:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:45:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-03 20:45:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:45:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2019-09-03 20:45:50,698 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 136 [2019-09-03 20:45:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:45:50,699 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2019-09-03 20:45:50,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:45:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2019-09-03 20:45:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:45:50,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:45:50,700 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:45:50,700 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:45:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:45:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -579878324, now seen corresponding path program 22 times [2019-09-03 20:45:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:45:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:50,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:45:50,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:50,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:45:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:45:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-03 20:45:51,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:51,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:45:51,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:45:51,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:45:51,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:51,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:45:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:45:51,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:45:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:45:51,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 223 conjunts are in the unsatisfiable core [2019-09-03 20:45:51,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:45:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-03 20:45:52,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 1175 refuted. 2 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:46:01,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:01,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 69] total 116 [2019-09-03 20:46:01,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:01,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:46:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:46:01,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=12029, Unknown=1, NotChecked=0, Total=13340 [2019-09-03 20:46:01,319 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 49 states. [2019-09-03 20:46:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:04,569 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-09-03 20:46:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:46:04,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2019-09-03 20:46:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:04,572 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:46:04,572 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:46:04,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 193 SyntacticMatches, 46 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2410, Invalid=16495, Unknown=1, NotChecked=0, Total=18906 [2019-09-03 20:46:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:46:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-09-03 20:46:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:46:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2019-09-03 20:46:04,577 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 142 [2019-09-03 20:46:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:04,577 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2019-09-03 20:46:04,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:46:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2019-09-03 20:46:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:46:04,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:04,579 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:04,579 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:04,579 INFO L82 PathProgramCache]: Analyzing trace with hash 626607594, now seen corresponding path program 23 times [2019-09-03 20:46:04,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:04,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-03 20:46:05,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:05,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:05,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:05,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:46:05,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:05,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:46:05,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:49:02,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:49:02,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:03,656 WARN L254 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 234 conjunts are in the unsatisfiable core [2019-09-03 20:49:03,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-03 20:49:03,846 INFO L322 TraceCheckSpWp]: Computing backward predicates...