java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:36:33,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:33,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:33,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:33,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:33,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:33,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:33,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:33,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:33,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:33,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:33,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:33,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:33,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:33,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:33,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:33,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:33,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:33,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:33,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:33,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:33,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:33,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:33,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:33,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:33,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:33,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:33,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:33,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:33,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:33,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:33,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:33,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:33,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:33,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:33,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:33,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:33,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:33,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:33,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:33,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:33,975 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:36:34,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:34,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:34,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:34,006 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:34,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:34,007 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:34,007 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:34,008 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:34,008 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:34,008 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:34,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:34,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:34,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:34,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:34,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:34,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:34,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:34,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:34,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:34,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:34,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:34,013 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:34,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:34,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:34,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:34,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:34,014 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:34,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:34,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:34,015 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:34,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:34,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:34,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:34,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:34,103 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:34,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-03 20:36:34,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211ebf325/6dcc143b6df04094baab427ec456d44e/FLAG9a485a9f4 [2019-09-03 20:36:34,586 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:34,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-03 20:36:34,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211ebf325/6dcc143b6df04094baab427ec456d44e/FLAG9a485a9f4 [2019-09-03 20:36:34,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211ebf325/6dcc143b6df04094baab427ec456d44e [2019-09-03 20:36:35,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:35,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:35,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:35,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:35,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:35,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:34" (1/1) ... [2019-09-03 20:36:35,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c78cde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35, skipping insertion in model container [2019-09-03 20:36:35,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:34" (1/1) ... [2019-09-03 20:36:35,022 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:35,039 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:35,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:35,287 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:35,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:35,327 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:35,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35 WrapperNode [2019-09-03 20:36:35,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:35,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:35,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:35,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:35,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (1/1) ... [2019-09-03 20:36:35,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:35,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:35,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:35,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:35,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (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:36:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:36:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:35,728 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:35,728 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:35,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:35 BoogieIcfgContainer [2019-09-03 20:36:35,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:35,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:35,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:35,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:35,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:34" (1/3) ... [2019-09-03 20:36:35,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ad686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:35, skipping insertion in model container [2019-09-03 20:36:35,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:35" (2/3) ... [2019-09-03 20:36:35,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ad686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:35, skipping insertion in model container [2019-09-03 20:36:35,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:35" (3/3) ... [2019-09-03 20:36:35,737 INFO L109 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2019-09-03 20:36:35,747 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:35,755 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:35,771 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:35,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:35,796 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:35,797 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:35,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:35,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:35,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:35,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:35,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 20:36:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:35,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:35,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:35,820 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 20:36:35,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:35,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:35,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:36,226 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-09-03 20:36:36,308 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:36:36,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:36:36,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:36,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:36:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:36:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:36,335 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2019-09-03 20:36:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:36,468 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-09-03 20:36:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:36:36,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-03 20:36:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:36,482 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:36:36,482 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:36:36,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:36:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:36:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:36:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:36:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:36:36,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:36:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:36,525 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:36:36,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:36:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:36:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:36:36,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:36,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:36,527 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 20:36:36,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:36,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:36,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:36,908 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:36:36,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:36,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:36,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-03 20:36:36,913 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-03 20:36:36,952 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:36,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:37,062 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:36:37,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:37,155 INFO L272 AbstractInterpreter]: Visited 11 different actions 35 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 5. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-03 20:36:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:37,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:37,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:37,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:37,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:37,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:37,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:36:37,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:37,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:37,357 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:36:37,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:37,510 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:36:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:37,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:36:37,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:37,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:36:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:36:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:36:37,519 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-09-03 20:36:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:37,657 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-03 20:36:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:36:37,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-09-03 20:36:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:37,659 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:36:37,659 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:36:37,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:36:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:36:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:36:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:36:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 20:36:37,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-09-03 20:36:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:37,664 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 20:36:37,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:36:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 20:36:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:36:37,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:37,665 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:37,666 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2019-09-03 20:36:37,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:37,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:37,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:37,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:38,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:38,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:38,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:38,054 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:36:38,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:38,055 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:36:38,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:38,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:38,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:36:38,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:38,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:36:38,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:38,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:38,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:38,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2019-09-03 20:36:38,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:38,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:36:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:36:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:36:38,652 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 15 states. [2019-09-03 20:36:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:38,822 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:36:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:36:38,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-09-03 20:36:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:38,823 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:36:38,823 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 20:36:38,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:36:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 20:36:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 20:36:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:36:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:36:38,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 20:36:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:38,828 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:36:38,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:36:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:36:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:36:38,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:38,829 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:38,830 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 3 times [2019-09-03 20:36:38,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:38,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:38,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:38,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:39,131 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-09-03 20:36:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:39,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:39,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:39,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:39,226 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:36:39,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:39,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:39,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:39,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:39,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:39,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:39,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:36:39,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:39,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:39,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2019-09-03 20:36:39,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:39,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:36:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:36:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:36:39,873 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 17 states. [2019-09-03 20:36:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:40,053 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 20:36:40,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:36:40,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-09-03 20:36:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:40,055 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:36:40,055 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:36:40,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:36:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:36:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:36:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:36:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:36:40,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 20:36:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:40,059 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:36:40,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:36:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:36:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:36:40,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:40,060 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:40,061 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 4 times [2019-09-03 20:36:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:40,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:40,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:40,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:40,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:40,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:40,398 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:36:40,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:40,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:40,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:40,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:36:40,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:40,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:41,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:41,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2019-09-03 20:36:41,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:41,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:36:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:36:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:36:41,127 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-09-03 20:36:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:41,336 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:36:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:36:41,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-09-03 20:36:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:41,338 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:36:41,338 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:36:41,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:36:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:36:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:36:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:36:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:36:41,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 20:36:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:41,342 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:36:41,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:36:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:36:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:36:41,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:41,343 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:41,343 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 5 times [2019-09-03 20:36:41,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:41,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:41,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:41,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:41,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:41,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:41,704 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:36:41,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:41,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:41,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:41,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:36:41,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:41,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:36:41,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:41,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:41,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:42,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:42,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2019-09-03 20:36:42,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:42,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:36:42,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:36:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:36:42,415 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-09-03 20:36:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:42,633 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 20:36:42,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:36:42,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-09-03 20:36:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:42,634 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:36:42,634 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:36:42,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:36:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:36:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:36:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:36:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 20:36:42,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 20:36:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:42,639 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 20:36:42,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:36:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 20:36:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:36:42,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:42,640 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:42,640 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 6 times [2019-09-03 20:36:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:42,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:42,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:43,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:43,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:43,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:43,004 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:36:43,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:43,004 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:36:43,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:43,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:36:43,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:43,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:43,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:36:43,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:43,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:43,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2019-09-03 20:36:44,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:44,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:36:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:36:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:36:44,039 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 23 states. [2019-09-03 20:36:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:44,291 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:36:44,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:36:44,292 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 17 [2019-09-03 20:36:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:44,292 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:36:44,293 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:36:44,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:36:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:36:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:36:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:36:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:36:44,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 20:36:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:44,302 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:36:44,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:36:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:36:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:36:44,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:44,306 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:44,306 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2019-09-03 20:36:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:44,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:44,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:44,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:44,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:44,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:44,832 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:36:44,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:44,832 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:36:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:44,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:44,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:36:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:45,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:45,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:45,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2019-09-03 20:36:45,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:45,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:36:45,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:36:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:36:45,932 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 25 states. [2019-09-03 20:36:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:46,304 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 20:36:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:36:46,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-09-03 20:36:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:46,305 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:36:46,306 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:36:46,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:36:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:36:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 20:36:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:36:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 20:36:46,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 20:36:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:46,310 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 20:36:46,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:36:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 20:36:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:36:46,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:46,311 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:46,311 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 8 times [2019-09-03 20:36:46,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:46,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:46,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:46,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:46,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:46,758 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:36:46,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:46,758 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:36:46,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:46,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:46,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:36:46,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:46,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:36:46,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:46,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:47,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:47,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:47,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2019-09-03 20:36:47,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:47,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:36:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:36:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:36:47,720 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-09-03 20:36:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:48,011 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:36:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:36:48,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-03 20:36:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:48,013 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:36:48,013 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:36:48,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:36:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:36:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 20:36:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:36:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:36:48,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 20:36:48,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:48,018 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:36:48,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:36:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:36:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:36:48,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:48,019 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:48,019 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 9 times [2019-09-03 20:36:48,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:48,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:48,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:48,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:48,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:48,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:48,509 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:36:48,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:48,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:36:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:48,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:36:52,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:52,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:52,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:36:52,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2019-09-03 20:36:59,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:59,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:36:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:36:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1301, Unknown=1, NotChecked=0, Total=1640 [2019-09-03 20:36:59,417 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 29 states. [2019-09-03 20:36:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:59,955 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 20:36:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:36:59,955 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-09-03 20:36:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:59,956 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:36:59,956 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:36:59,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=362, Invalid=1443, Unknown=1, NotChecked=0, Total=1806 [2019-09-03 20:36:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:36:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:36:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:36:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 20:36:59,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 20:36:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:59,961 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 20:36:59,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:36:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 20:36:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:36:59,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:59,964 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:59,964 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 10 times [2019-09-03 20:36:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:00,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:00,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:00,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:00,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:37:00,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:00,630 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) [2019-09-03 20:37:00,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:00,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:00,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:37:00,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:37:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:01,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:02,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:02,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2019-09-03 20:37:02,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:02,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:37:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:37:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:37:02,526 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 31 states. [2019-09-03 20:37:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:02,922 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:37:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:37:02,923 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 21 [2019-09-03 20:37:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:02,924 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:37:02,924 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:37:02,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=417, Invalid=1653, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:37:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:37:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 20:37:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:37:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:37:02,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 20:37:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:02,929 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:37:02,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:37:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:37:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:37:02,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:02,930 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:02,930 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 11 times [2019-09-03 20:37:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:03,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:03,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:03,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:03,545 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:03,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:03,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:03,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:27,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:37:27,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:37:28,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:37:28,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-03 20:37:28,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:28,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:37:28,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:37:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:37:28,354 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2019-09-03 20:37:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,631 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 20:37:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:37:28,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-03 20:37:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,632 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:37:28,632 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:37:28,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:37:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:37:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:37:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 20:37:28,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 20:37:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,638 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 20:37:28,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:37:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 20:37:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:37:28,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,640 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:28,640 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 12 times [2019-09-03 20:37:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:29,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:29,263 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:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,263 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:37:29,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:29,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:29,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:29,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:29,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:37:29,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:29,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:37:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2019-09-03 20:37:30,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:30,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:37:30,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:37:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:37:30,813 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-09-03 20:37:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:31,191 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 20:37:31,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:37:31,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-09-03 20:37:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:31,193 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:37:31,193 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:37:31,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:37:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:37:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:37:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:37:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:37:31,197 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 20:37:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:37:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:37:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:37:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:37:31,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:31,198 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:31,198 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 13 times [2019-09-03 20:37:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:31,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:31,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:31,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:31,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:31,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:31,838 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:31,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:31,839 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:37:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:31,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:32,069 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:37:32,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:32,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:37:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:32,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:34,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2019-09-03 20:37:34,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:34,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:37:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:37:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2181, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:37:34,302 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 37 states. [2019-09-03 20:37:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:34,814 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 20:37:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:37:34,814 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 24 [2019-09-03 20:37:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:34,815 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:37:34,816 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:37:34,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=603, Invalid=2367, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:37:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:37:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 20:37:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:37:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 20:37:34,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 20:37:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:34,821 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 20:37:34,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:37:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 20:37:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:37:34,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:34,822 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:34,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 14 times [2019-09-03 20:37:34,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:35,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:35,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:35,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:35,538 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:35,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:35,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:35,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:35,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:47,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:37:47,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:37:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:37:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-09-03 20:37:47,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:47,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:37:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:37:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:47,816 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 21 states. [2019-09-03 20:37:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:48,197 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 20:37:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:37:48,197 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-09-03 20:37:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:48,198 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:37:48,198 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:37:48,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:37:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:37:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:37:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:37:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:37:48,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 20:37:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:48,203 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:37:48,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:37:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:37:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:37:48,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:48,204 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:48,205 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 15 times [2019-09-03 20:37:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:48,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:48,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:48,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:48,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:48,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:48,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:37:48,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:48,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 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:37:48,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:48,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:50,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:50,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:50,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:37:50,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:37:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:51,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 59 [2019-09-03 20:38:00,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:00,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:38:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:38:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=2705, Unknown=3, NotChecked=0, Total=3422 [2019-09-03 20:38:00,212 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 41 states. [2019-09-03 20:38:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:00,934 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 20:38:00,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:38:00,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2019-09-03 20:38:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:00,935 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:38:00,936 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:38:00,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=744, Invalid=2913, Unknown=3, NotChecked=0, Total=3660 [2019-09-03 20:38:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:38:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 20:38:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:38:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 20:38:00,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 20:38:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:00,940 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 20:38:00,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:38:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 20:38:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:38:00,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:00,941 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:00,941 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 16 times [2019-09-03 20:38:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:00,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:00,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:01,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:01,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:01,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:01,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:38:01,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:01,834 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:38:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:01,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:02,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:38:02,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:04,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:06,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 62 [2019-09-03 20:38:06,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:06,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:38:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:38:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=2988, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:38:06,383 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 43 states. [2019-09-03 20:38:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:07,363 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:38:07,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:38:07,363 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 27 [2019-09-03 20:38:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:07,364 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:38:07,364 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:38:07,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=825, Invalid=3207, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:38:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:38:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 20:38:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:38:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:38:07,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 20:38:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:07,370 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:38:07,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:38:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:38:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:38:07,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:07,371 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:07,371 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 17 times [2019-09-03 20:38:07,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:07,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:08,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:08,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:08,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:08,172 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:38:08,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:08,172 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:38:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:08,203 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:38:50,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:38:50,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:38:52,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:38:52,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-09-03 20:38:52,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:52,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:38:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:38:52,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:38:52,755 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 24 states. [2019-09-03 20:38:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:53,248 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 20:38:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:38:53,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-09-03 20:38:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:53,249 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:38:53,249 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:38:53,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:38:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:38:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 20:38:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:38:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 20:38:53,257 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 20:38:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:53,258 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 20:38:53,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:38:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 20:38:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:38:53,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:53,259 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:53,259 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:53,261 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 18 times [2019-09-03 20:38:53,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:53,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:53,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:53,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:53,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:54,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:54,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:54,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:54,106 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:38:54,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:54,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:54,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:06,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:06,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:39:06,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:39:06,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-09-03 20:39:06,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:06,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:39:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:39:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:39:06,331 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 25 states. [2019-09-03 20:39:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:06,884 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 20:39:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:39:06,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-09-03 20:39:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:06,885 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:39:06,885 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:39:06,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:39:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:39:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:39:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:39:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 20:39:06,889 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 20:39:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:06,890 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 20:39:06,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:39:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 20:39:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:39:06,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:06,891 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:06,891 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 19 times [2019-09-03 20:39:06,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:06,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:06,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:07,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:07,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:07,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:07,753 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:39:07,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:07,753 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:39:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:07,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:07,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:39:07,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:39:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:08,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:13,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:13,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 71 [2019-09-03 20:39:13,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:13,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:39:13,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:39:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1048, Invalid=3921, Unknown=1, NotChecked=0, Total=4970 [2019-09-03 20:39:13,891 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 49 states. [2019-09-03 20:39:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:14,755 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 20:39:14,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:39:14,756 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 30 [2019-09-03 20:39:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:14,757 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:39:14,757 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:39:14,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1082, Invalid=4173, Unknown=1, NotChecked=0, Total=5256 [2019-09-03 20:39:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:39:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:39:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:39:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 20:39:14,762 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 20:39:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:14,763 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 20:39:14,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:39:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 20:39:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:39:14,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:14,764 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:14,764 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:14,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 20 times [2019-09-03 20:39:14,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:14,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:14,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:15,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:15,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:15,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:15,652 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:39:15,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:15,652 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:39:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:15,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:28,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:39:28,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:28,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 20:39:28,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:39:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:34,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:47,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:47,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 60 [2019-09-03 20:39:47,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:47,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:39:47,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:39:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=2758, Unknown=4, NotChecked=0, Total=3540 [2019-09-03 20:39:47,578 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 37 states. [2019-09-03 20:39:56,838 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-09-03 20:39:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:57,192 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 20:39:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:39:57,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 31 [2019-09-03 20:39:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:57,194 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:39:57,194 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:39:57,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=813, Invalid=2962, Unknown=7, NotChecked=0, Total=3782 [2019-09-03 20:39:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:39:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:39:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:39:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:39:57,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 20:39:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:57,199 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:39:57,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:39:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:39:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:39:57,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:57,200 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:57,201 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:57,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 21 times [2019-09-03 20:39:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:57,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:57,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:57,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:58,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:58,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:58,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:58,167 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:39:58,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:58,167 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:39:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:58,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:40:03,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:03,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:03,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:40:03,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:04,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:40:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:04,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:08,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 77 [2019-09-03 20:40:08,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:08,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:40:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:40:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1239, Invalid=4613, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:40:08,046 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 53 states. [2019-09-03 20:40:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:09,293 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 20:40:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:40:09,293 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 32 [2019-09-03 20:40:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:09,294 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:40:09,294 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:40:09,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1275, Invalid=4887, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:40:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:40:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 20:40:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:40:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 20:40:09,298 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 20:40:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:09,298 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 20:40:09,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:40:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 20:40:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:40:09,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:09,299 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:09,299 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 22 times [2019-09-03 20:40:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:09,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:09,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:10,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:10,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:10,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:10,578 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:10,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:10,578 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:40:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:10,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:40:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:14,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:40:14,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:40:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:15,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 274 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:24,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:24,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 80 [2019-09-03 20:40:24,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:24,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:40:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:40:24,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1340, Invalid=4978, Unknown=2, NotChecked=0, Total=6320 [2019-09-03 20:40:24,357 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 55 states. [2019-09-03 20:40:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:25,411 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 20:40:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:40:25,412 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 33 [2019-09-03 20:40:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:25,413 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:40:25,413 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:40:25,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1377, Invalid=5263, Unknown=2, NotChecked=0, Total=6642 [2019-09-03 20:40:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:40:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:40:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:40:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 20:40:25,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 20:40:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:25,417 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 20:40:25,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:40:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 20:40:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:40:25,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:25,418 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:25,418 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 23 times [2019-09-03 20:40:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:25,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:40:26,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:26,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:26,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:26,463 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,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:26,463 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:40:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:26,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:29,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:41:29,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:41:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:41:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-03 20:41:30,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:30,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:41:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:41:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:41:30,836 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 30 states. [2019-09-03 20:41:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:31,584 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 20:41:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:41:31,585 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-09-03 20:41:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:31,586 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:41:31,586 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:41:31,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:41:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:41:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 20:41:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:41:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 20:41:31,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 20:41:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:31,590 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 20:41:31,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:41:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 20:41:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:41:31,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:31,591 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:31,591 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 24 times [2019-09-03 20:41:31,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:31,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:31,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:31,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:32,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:32,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:32,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:32,729 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:41:32,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:32,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:32,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:48,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:48,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:41:57,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:41:57,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-09-03 20:41:57,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:57,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:41:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:41:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:41:57,249 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 31 states. [2019-09-03 20:41:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:58,065 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:41:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:41:58,066 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-09-03 20:41:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:58,067 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:41:58,067 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:41:58,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:41:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:41:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 20:41:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:41:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 20:41:58,070 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 20:41:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:58,070 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 20:41:58,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:41:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 20:41:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:41:58,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:58,071 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:58,071 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 25 times [2019-09-03 20:41:58,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:58,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:58,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:59,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:59,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:59,214 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:41:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:59,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:59,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:59,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-03 20:42:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:42:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-03 20:42:11,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:11,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:42:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:42:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:42:11,390 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 32 states. [2019-09-03 20:42:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:12,271 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 20:42:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:42:12,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-09-03 20:42:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:12,273 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:42:12,273 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:42:12,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:42:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:42:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 20:42:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:42:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 20:42:12,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 20:42:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:12,277 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 20:42:12,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:42:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 20:42:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:42:12,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:12,278 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:12,278 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 26 times [2019-09-03 20:42:12,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:12,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:13,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:13,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:13,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:13,773 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:13,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:13,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:13,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:43:54,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:43:54,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:43:56,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:43:56,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-09-03 20:43:56,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:56,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:43:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:43:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:43:56,062 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 33 states. [2019-09-03 20:43:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:56,981 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 20:43:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:43:56,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-09-03 20:43:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:56,983 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:43:56,983 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:43:56,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:43:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:43:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 20:43:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:43:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 20:43:56,987 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 20:43:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:56,987 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 20:43:56,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:43:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 20:43:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:43:56,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:56,988 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:56,988 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:56,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 27 times [2019-09-03 20:43:56,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:56,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:56,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:56,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:56,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:58,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:58,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:58,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:58,329 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:58,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:58,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:43:58,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:43:58,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:43:58,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:58,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 20:43:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:00,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:44:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:00,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:08,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:08,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 95 [2019-09-03 20:44:08,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:08,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:44:08,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:44:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1904, Invalid=7025, Unknown=1, NotChecked=0, Total=8930 [2019-09-03 20:44:08,878 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 65 states. [2019-09-03 20:44:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:10,698 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 20:44:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:44:10,698 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 38 [2019-09-03 20:44:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:10,699 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:44:10,699 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:44:10,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1946, Invalid=7365, Unknown=1, NotChecked=0, Total=9312 [2019-09-03 20:44:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:44:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:44:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:44:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 20:44:10,702 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 20:44:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:10,702 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 20:44:10,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:44:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 20:44:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:44:10,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:10,703 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:10,703 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 28 times [2019-09-03 20:44:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:10,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:10,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:12,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:12,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:12,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:12,058 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:44:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:12,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:12,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:44:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:13,362 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 20:44:13,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:44:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:15,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 98 [2019-09-03 20:44:28,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:28,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:44:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:44:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=7476, Unknown=2, NotChecked=0, Total=9506 [2019-09-03 20:44:28,360 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 67 states. [2019-09-03 20:44:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:32,782 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 20:44:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:44:32,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 39 [2019-09-03 20:44:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:32,784 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:44:32,784 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:44:32,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=2071, Invalid=7827, Unknown=2, NotChecked=0, Total=9900 [2019-09-03 20:44:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:44:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:44:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:44:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 20:44:32,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 20:44:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:32,788 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 20:44:32,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:44:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 20:44:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:44:32,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:32,789 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:32,789 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 29 times [2019-09-03 20:44:32,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:32,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:32,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:32,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:32,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:34,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:34,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:34,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:34,202 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:44:34,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:34,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:34,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:34,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:45:40,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:45:40,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:45:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:45:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-09-03 20:45:52,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:45:52,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:45:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:45:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:45:52,791 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 36 states. [2019-09-03 20:45:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:45:53,905 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 20:45:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:45:53,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-09-03 20:45:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:45:53,906 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:45:53,906 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:45:53,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:45:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:45:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 20:45:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:45:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 20:45:53,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 20:45:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:45:53,910 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 20:45:53,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:45:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 20:45:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:45:53,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:45:53,910 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:45:53,910 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:45:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:45:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 30 times [2019-09-03 20:45:53,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:45:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:53,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:45:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:45:53,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:45:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:45:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:45:55,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:55,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:45:55,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:45:55,377 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:55,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:45:55,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:45:55,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:45:55,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:46:00,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:46:00,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:46:00,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 20:46:00,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:02,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:46:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:03,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:11,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2019-09-03 20:46:11,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:11,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:46:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:46:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2291, Invalid=8420, Unknown=1, NotChecked=0, Total=10712 [2019-09-03 20:46:11,156 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 71 states. [2019-09-03 20:46:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:13,653 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 20:46:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:46:13,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 41 [2019-09-03 20:46:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:13,654 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:46:13,654 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:46:13,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2879 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2336, Invalid=8793, Unknown=1, NotChecked=0, Total=11130 [2019-09-03 20:46:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:46:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:46:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:46:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 20:46:13,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 20:46:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:13,658 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 20:46:13,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:46:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 20:46:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:46:13,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:13,658 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:13,659 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:13,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 31 times [2019-09-03 20:46:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:13,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:46:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:13,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:15,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:15,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:15,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:15,668 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:15,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:15,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:15,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:15,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:46:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:21,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:46:21,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:46:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:46:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:23,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:46:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:35,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:46:35,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 107 [2019-09-03 20:46:35,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:46:35,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:46:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:46:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2427, Invalid=8913, Unknown=2, NotChecked=0, Total=11342 [2019-09-03 20:46:35,324 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 73 states. [2019-09-03 20:46:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:46:37,247 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 20:46:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:46:37,248 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 42 [2019-09-03 20:46:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:46:37,249 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:46:37,249 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:46:37,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2473, Invalid=9297, Unknown=2, NotChecked=0, Total=11772 [2019-09-03 20:46:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:46:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:46:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:46:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 20:46:37,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 20:46:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:46:37,253 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 20:46:37,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:46:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 20:46:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:46:37,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:46:37,254 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:46:37,254 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:46:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:46:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 32 times [2019-09-03 20:46:37,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:46:37,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:37,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:46:37,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:46:37,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:46:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:46:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:46:39,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:39,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:46:39,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:46:39,442 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:39,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:46:39,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:46:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:46:39,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:49:29,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:49:29,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:49:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:49:31,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-09-03 20:49:31,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:49:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:49:31,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:49:31,380 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 39 states. [2019-09-03 20:49:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:32,690 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 20:49:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:49:32,690 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-09-03 20:49:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:32,691 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:49:32,691 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:49:32,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:49:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:49:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 20:49:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:49:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 20:49:32,694 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 20:49:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:32,695 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 20:49:32,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:49:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 20:49:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:49:32,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:32,695 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:32,696 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 33 times [2019-09-03 20:49:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:32,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:32,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:34,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:34,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:34,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:34,530 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:49:34,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:34,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:49:34,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:49:34,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:49:34,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:34,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 20:49:34,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:37,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:49:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:37,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:45,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 113 [2019-09-03 20:49:45,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:45,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:49:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:49:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2715, Invalid=9941, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:49:45,929 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 77 states. [2019-09-03 20:49:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:48,787 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 20:49:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:49:48,787 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 44 [2019-09-03 20:49:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:48,788 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:49:48,788 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:49:48,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2763, Invalid=10347, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 20:49:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:49:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 20:49:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:49:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 20:49:48,791 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 20:49:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:48,792 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 20:49:48,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:49:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 20:49:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:49:48,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:48,792 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:48,793 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 34 times [2019-09-03 20:49:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:48,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:48,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:48,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:50,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:50,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:50,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:50,535 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:49:50,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:50,535 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:50,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:50,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-03 20:50:02,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:50:02,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-09-03 20:50:02,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:02,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:50:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:50:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:50:02,994 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 41 states. [2019-09-03 20:50:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:04,445 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 20:50:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:50:04,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-09-03 20:50:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:04,446 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:50:04,447 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:50:04,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:50:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:50:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 20:50:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:50:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 20:50:04,449 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-03 20:50:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:04,450 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 20:50:04,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:50:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 20:50:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:50:04,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:04,451 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:04,451 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 35 times [2019-09-03 20:50:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:04,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:04,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:06,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:06,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:06,168 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:50:06,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:06,168 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:50:06,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)