java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:06:28,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:06:28,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:06:28,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:06:28,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:06:28,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:06:28,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:06:28,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:06:28,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:06:28,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:06:28,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:06:28,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:06:28,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:06:28,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:06:28,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:06:28,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:06:28,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:06:28,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:06:28,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:06:28,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:06:28,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:06:28,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:06:28,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:06:28,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:06:28,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:06:28,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:06:28,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:06:28,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:06:28,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:06:28,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:06:28,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:06:28,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:06:28,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:06:28,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:06:28,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:06:28,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:06:28,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:06:28,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:06:28,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:06:28,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:06:28,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:06:28,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:06:28,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:06:28,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:06:28,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:06:28,822 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:06:28,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:06:28,823 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:06:28,823 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:06:28,823 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:06:28,824 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:06:28,824 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:06:28,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:06:28,826 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:06:28,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:06:28,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:06:28,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:06:28,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:06:28,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:06:28,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:06:28,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:06:28,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:06:28,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:06:28,828 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:06:28,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:06:28,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:06:28,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:06:28,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:06:28,829 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:06:28,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:06:28,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:06:28,830 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:06:28,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:06:28,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:06:28,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:06:28,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:06:28,885 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:06:28,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2019-09-10 03:06:28,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca89f7f9a/ea937646f04f4268b824d50995909df3/FLAGf24946fe8 [2019-09-10 03:06:29,379 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:06:29,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2019-09-10 03:06:29,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca89f7f9a/ea937646f04f4268b824d50995909df3/FLAGf24946fe8 [2019-09-10 03:06:29,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca89f7f9a/ea937646f04f4268b824d50995909df3 [2019-09-10 03:06:29,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:06:29,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:06:29,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:29,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:06:29,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:06:29,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:29" (1/1) ... [2019-09-10 03:06:29,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52660538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:29, skipping insertion in model container [2019-09-10 03:06:29,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:29" (1/1) ... [2019-09-10 03:06:29,835 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:06:29,849 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:06:30,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:30,025 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:06:30,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:30,048 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:06:30,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30 WrapperNode [2019-09-10 03:06:30,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:30,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:06:30,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:06:30,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:06:30,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... [2019-09-10 03:06:30,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:06:30,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:06:30,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:06:30,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:06:30,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:06:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:06:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:06:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:06:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:06:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:06:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:06:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:06:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:06:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:06:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:06:30,339 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:06:30,339 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:06:30,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:30 BoogieIcfgContainer [2019-09-10 03:06:30,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:06:30,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:06:30,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:06:30,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:06:30,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:06:29" (1/3) ... [2019-09-10 03:06:30,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:30, skipping insertion in model container [2019-09-10 03:06:30,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:30" (2/3) ... [2019-09-10 03:06:30,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:30, skipping insertion in model container [2019-09-10 03:06:30,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:30" (3/3) ... [2019-09-10 03:06:30,348 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-1.c [2019-09-10 03:06:30,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:06:30,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:06:30,379 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:06:30,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:06:30,405 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:06:30,405 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:06:30,405 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:06:30,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:06:30,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:06:30,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:06:30,406 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:06:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:06:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:06:30,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:30,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:30,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-10 03:06:30,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:06:30,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:30,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:30,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:30,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:30,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:30,636 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:06:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:30,711 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-10 03:06:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:30,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:06:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:30,722 INFO L225 Difference]: With dead ends: 22 [2019-09-10 03:06:30,723 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:06:30,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:06:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:06:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:06:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:06:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:06:30,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:06:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:30,765 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:06:30,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:06:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:06:30,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:30,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:30,768 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-10 03:06:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:30,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:30,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:30,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:30,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:30,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:06:30,844 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:06:30,884 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:30,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:31,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:06:31,056 INFO L272 AbstractInterpreter]: Visited 17 different actions 107 times. Merged at 7 different actions 45 times. Widened at 1 different actions 4 times. Performed 160 root evaluator evaluations with a maximum evaluation depth of 3. Performed 160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:06:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:31,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:06:31,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:31,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:31,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:31,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:06:31,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:31,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:06:31,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:31,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-09-10 03:06:31,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:06:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:06:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:06:31,383 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-10 03:06:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:31,462 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-10 03:06:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:06:31,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 03:06:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:31,464 INFO L225 Difference]: With dead ends: 21 [2019-09-10 03:06:31,464 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:06:31,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:06:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:06:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:06:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:06:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:06:31,471 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:06:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:31,471 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:06:31,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:06:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:06:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:06:31,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:31,473 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:31,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-10 03:06:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:31,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:06:31,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:31,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:31,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:31,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:06:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:31,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:31,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:06:31,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:31,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:06:31,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:06:31,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:31,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 03:06:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-09-10 03:06:32,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:32,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:06:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:06:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:06:32,057 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-09-10 03:06:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:32,123 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-10 03:06:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:06:32,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 03:06:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:32,125 INFO L225 Difference]: With dead ends: 24 [2019-09-10 03:06:32,126 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:06:32,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:06:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:06:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:06:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:06:32,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:06:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:32,132 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:06:32,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:06:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:06:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:06:32,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:32,134 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:32,134 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-10 03:06:32,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:32,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:32,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:32,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:32,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:32,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:32,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:32,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:32,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:06:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:32,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:32,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:32,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:32,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:06:32,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:32,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:06:32,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:32,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-09-10 03:06:32,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:32,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:06:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:06:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:06:32,864 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-09-10 03:06:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:32,946 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-10 03:06:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:06:32,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-10 03:06:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:32,948 INFO L225 Difference]: With dead ends: 27 [2019-09-10 03:06:32,948 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:06:32,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:06:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:06:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:06:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:06:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:06:32,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:06:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:32,954 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:06:32,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:06:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:06:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:06:32,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:32,956 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:32,956 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-10 03:06:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:06:33,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:33,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:33,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:33,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:33,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:33,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:33,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:33,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:33,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:06:33,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:06:33,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:33,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:06:33,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:33,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-09-10 03:06:33,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:33,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:06:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:06:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:33,893 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-09-10 03:06:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:33,984 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-09-10 03:06:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:06:33,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 03:06:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:33,987 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:06:33,987 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:06:33,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:06:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:06:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:06:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:06:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:06:33,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:06:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:33,994 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:06:33,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:06:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:06:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:06:33,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:33,995 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:33,996 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-10 03:06:33,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:33,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:06:34,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:34,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:34,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:34,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:34,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:34,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:34,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:34,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:06:34,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:34,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 03:06:34,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:06:34,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:35,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-09-10 03:06:35,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:35,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:06:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:06:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:06:35,343 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-09-10 03:06:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:35,448 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-10 03:06:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:06:35,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-10 03:06:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:35,450 INFO L225 Difference]: With dead ends: 33 [2019-09-10 03:06:35,450 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:06:35,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:06:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:06:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:06:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:06:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:06:35,460 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:06:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:35,461 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:06:35,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:06:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:06:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:06:35,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:35,465 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:35,466 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-10 03:06:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:35,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:35,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:06:35,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:35,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:35,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:35,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:35,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:35,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:35,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:35,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:35,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:35,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:35,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:06:35,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:06:35,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:36,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:06:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-09-10 03:06:37,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:37,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:06:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:06:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:06:37,518 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-09-10 03:06:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:37,631 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-09-10 03:06:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:06:37,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-10 03:06:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:37,634 INFO L225 Difference]: With dead ends: 36 [2019-09-10 03:06:37,634 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:06:37,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:06:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:06:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:06:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:06:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:06:37,640 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:06:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:37,640 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:06:37,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:06:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:06:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:06:37,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:37,642 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:37,642 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-10 03:06:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:37,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:06:37,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:37,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:37,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:37,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:37,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:37,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:37,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:37,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:06:37,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:06:37,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:06:40,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:40,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-09-10 03:06:40,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:40,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:06:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:06:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:06:40,578 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-09-10 03:06:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:40,726 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-09-10 03:06:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:06:40,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 03:06:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:40,728 INFO L225 Difference]: With dead ends: 39 [2019-09-10 03:06:40,728 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:06:40,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:06:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:06:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:06:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:06:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:06:40,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:06:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:40,737 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:06:40,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:06:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:06:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:06:40,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:40,738 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:40,739 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-10 03:06:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:40,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:06:40,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:40,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:40,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:40,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:40,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:40,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:40,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:40,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:40,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:06:40,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:40,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:06:40,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:06:40,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 03:06:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-09-10 03:06:44,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:44,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:06:44,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:06:44,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:06:44,711 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-09-10 03:06:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:44,837 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-10 03:06:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:06:44,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 03:06:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:44,839 INFO L225 Difference]: With dead ends: 42 [2019-09-10 03:06:44,840 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:06:44,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:06:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:06:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:06:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:06:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:06:44,847 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:06:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:44,847 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:06:44,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:06:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:06:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:06:44,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:44,849 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:44,849 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-10 03:06:44,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:44,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:44,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:06:44,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:44,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:44,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:44,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:44,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:44,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:45,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:45,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:45,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 03:06:45,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:06:45,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:47,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:50,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:06:50,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:50,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-09-10 03:06:50,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:50,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:06:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:06:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:06:50,201 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2019-09-10 03:06:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:50,369 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-09-10 03:06:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:06:50,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-09-10 03:06:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:50,371 INFO L225 Difference]: With dead ends: 45 [2019-09-10 03:06:50,371 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:06:50,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:06:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:06:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:06:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:06:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:06:50,378 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:06:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:50,378 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:06:50,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:06:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:06:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:06:50,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:50,380 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:50,380 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-10 03:06:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:50,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:50,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:06:50,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:50,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:50,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:50,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:50,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:50,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:50,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:50,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:06:50,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:06:50,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:53,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:54,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:55,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 03:06:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-09-10 03:06:57,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:57,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:06:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:06:57,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:06:57,412 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2019-09-10 03:06:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:57,566 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-09-10 03:06:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:06:57,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-10 03:06:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:57,569 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:06:57,569 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:06:57,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:06:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:06:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 03:06:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:06:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:06:57,576 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-10 03:06:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:57,576 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:06:57,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:06:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:06:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:06:57,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:57,578 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:57,578 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2019-09-10 03:06:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:57,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:06:57,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:57,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:57,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:57,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:57,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:57,788 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) [2019-09-10 03:06:57,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:57,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:57,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:06:57,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:57,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 03:06:57,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:06:57,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:04,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:04,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:05,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 03:07:06,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:06,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-09-10 03:07:06,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:06,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:07:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:07:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:07:06,852 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2019-09-10 03:07:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:07,058 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-09-10 03:07:07,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 03:07:07,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-10 03:07:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:07,060 INFO L225 Difference]: With dead ends: 51 [2019-09-10 03:07:07,060 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:07:07,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:07:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:07:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 03:07:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:07:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:07:07,073 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-10 03:07:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:07,073 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:07:07,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:07:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:07:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:07:07,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:07,075 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:07,075 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2019-09-10 03:07:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:07,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:07,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:07,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:07:07,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:07,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:07,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:07,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:07:07,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:07,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:07:07,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:07:07,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:07:07,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:07:07,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:07:07,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:07:07,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:11,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:13,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:16,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:16,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:17,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 03:07:18,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:18,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-09-10 03:07:18,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:18,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:07:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:07:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:07:18,811 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2019-09-10 03:07:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:19,028 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-09-10 03:07:19,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:07:19,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 03:07:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:19,029 INFO L225 Difference]: With dead ends: 54 [2019-09-10 03:07:19,029 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:07:19,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:07:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:07:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 03:07:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:07:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:07:19,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-10 03:07:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:19,037 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:07:19,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:07:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:07:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:07:19,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:19,039 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:19,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2019-09-10 03:07:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:19,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:19,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:19,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:07:19,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:19,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:19,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:19,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:07:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:19,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:07:19,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:07:19,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:19,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 03:07:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:07:19,353 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:24,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:30,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:31,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:31,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-10 03:07:33,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:33,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-09-10 03:07:33,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:33,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:07:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:07:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:07:33,813 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2019-09-10 03:07:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:34,051 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-09-10 03:07:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:07:34,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 03:07:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:34,053 INFO L225 Difference]: With dead ends: 57 [2019-09-10 03:07:34,053 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:07:34,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:07:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:07:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 03:07:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:07:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:07:34,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-10 03:07:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:34,060 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:07:34,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:07:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:07:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:07:34,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:34,062 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:34,062 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2019-09-10 03:07:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:07:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:34,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:07:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:34,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:34,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:34,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:07:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:34,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:07:34,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:07:34,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:07:34,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:07:34,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:07:34,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:07:34,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:45,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:49,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:50,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:51,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:51,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:51,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:07:52,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:52,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2019-09-10 03:07:52,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:52,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:07:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:07:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:07:52,383 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-09-10 03:07:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:52,648 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-10 03:07:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:07:52,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-09-10 03:07:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:52,649 INFO L225 Difference]: With dead ends: 60 [2019-09-10 03:07:52,649 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:07:52,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 30 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:07:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:07:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 03:07:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:07:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:07:52,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-10 03:07:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:52,663 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:07:52,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:07:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:07:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:07:52,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:52,665 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:52,666 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2019-09-10 03:07:52,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:52,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:52,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:52,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:07:52,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:52,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:52,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:52,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:07:52,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:52,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:07:52,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:07:52,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:07:52,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:07:52,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 03:07:52,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:07:52,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:59,316 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-10 03:08:00,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:03,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:06,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:08,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:10,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:11,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:12,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:14,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:15,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-10 03:08:15,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:15,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2019-09-10 03:08:15,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:15,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:08:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:08:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:08:15,252 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2019-09-10 03:08:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:15,508 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-09-10 03:08:15,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:08:15,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-10 03:08:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:15,510 INFO L225 Difference]: With dead ends: 63 [2019-09-10 03:08:15,510 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 03:08:15,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 32 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:08:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 03:08:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-10 03:08:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 03:08:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-10 03:08:15,516 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2019-09-10 03:08:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:15,516 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-10 03:08:15,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:08:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-10 03:08:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:08:15,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:15,518 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:15,518 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2019-09-10 03:08:15,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:15,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:15,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:08:15,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:15,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:15,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:15,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:08:15,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:15,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:15,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:15,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:08:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:15,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 03:08:15,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:08:15,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:18,073 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-10 03:08:18,743 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:08:18,846 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:08:18,955 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 03:08:19,066 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 03:08:19,175 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:08:19,279 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:08:24,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:28,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:37,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:40,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:40,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:41,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:08:42,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2019-09-10 03:08:42,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:42,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:08:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:08:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 03:08:42,730 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2019-09-10 03:08:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:43,041 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-10 03:08:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:08:43,042 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-09-10 03:08:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:43,043 INFO L225 Difference]: With dead ends: 66 [2019-09-10 03:08:43,043 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 03:08:43,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:08:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 03:08:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 03:08:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 03:08:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 03:08:43,050 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2019-09-10 03:08:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:43,050 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 03:08:43,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:08:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 03:08:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 03:08:43,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:43,052 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:43,052 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2019-09-10 03:08:43,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:43,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:43,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:43,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:43,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:08:43,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:43,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:43,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:43,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:08:43,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:43,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:43,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:08:43,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:08:43,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:08:43,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:43,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 03:08:43,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:08:43,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:46,287 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:08:46,495 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:08:46,603 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:08:46,718 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:08:46,826 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:08:46,944 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 03:08:47,063 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 03:08:47,197 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-09-10 03:08:47,304 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-09-10 03:08:47,409 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-10 03:08:47,510 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 03:08:51,503 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:08:51,709 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:08:51,810 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:08:51,919 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:08:52,027 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:08:52,135 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:08:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:08:57,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:04,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:06,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:08,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:10,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:11,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:12,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:14,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-10 03:09:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2019-09-10 03:09:15,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:15,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:09:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:09:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:09:15,623 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2019-09-10 03:09:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:15,927 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-09-10 03:09:15,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 03:09:15,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-09-10 03:09:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:15,929 INFO L225 Difference]: With dead ends: 69 [2019-09-10 03:09:15,930 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 03:09:15,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 193 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 03:09:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 03:09:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-10 03:09:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 03:09:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-10 03:09:15,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2019-09-10 03:09:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:15,935 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-10 03:09:15,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:09:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-10 03:09:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 03:09:15,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:15,937 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:15,937 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2019-09-10 03:09:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:15,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:15,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:15,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:15,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:09:16,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:16,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:16,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:16,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:16,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:16,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:16,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:16,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:16,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:16,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 03:09:16,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:09:16,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:18,789 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:09:19,185 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:09:19,395 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:19,503 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:19,617 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:19,734 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:19,852 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:19,968 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:20,092 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:09:20,211 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:09:20,346 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-10 03:09:20,476 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-10 03:09:20,600 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-10 03:09:20,718 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-10 03:09:20,831 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-09-10 03:09:20,941 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 03:09:21,047 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-10 03:09:21,148 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 03:09:25,351 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:09:25,465 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:09:25,574 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:25,681 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:25,795 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:25,905 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:26,026 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:26,140 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:26,255 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:09:26,365 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:09:26,474 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:09:26,578 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:09:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:30,843 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:09:31,054 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:31,162 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:31,377 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:09:32,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:36,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:40,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:43,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:45,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:47,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:52,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:52,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:09:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-10 03:09:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2019-09-10 03:09:54,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:54,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 03:09:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 03:09:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:09:54,787 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2019-09-10 03:09:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:55,169 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-10 03:09:55,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:09:55,170 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2019-09-10 03:09:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:55,171 INFO L225 Difference]: With dead ends: 72 [2019-09-10 03:09:55,171 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 03:09:55,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:09:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 03:09:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-10 03:09:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:09:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-10 03:09:55,180 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2019-09-10 03:09:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:55,181 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-10 03:09:55,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 03:09:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-10 03:09:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 03:09:55,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:55,184 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:55,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2019-09-10 03:09:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:55,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:55,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:09:55,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:55,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:55,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:55,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:55,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:55,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:55,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:55,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:55,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 03:09:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:09:55,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:58,497 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:09:58,709 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:58,818 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:09:58,933 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:59,044 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:09:59,160 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:59,270 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:09:59,391 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:09:59,510 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:09:59,645 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:09:59,772 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:09:59,907 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:10:00,040 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:10:00,180 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-10 03:10:00,314 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-09-10 03:10:00,458 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-09-10 03:10:00,584 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-10 03:10:00,709 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-10 03:10:00,828 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-09-10 03:10:00,941 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-09-10 03:10:01,058 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 03:10:01,166 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-10 03:10:05,277 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:10:05,478 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:05,587 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:05,696 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:05,810 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:05,927 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:06,038 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:06,168 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:06,284 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:06,407 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:10:06,550 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:10:06,691 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:10:06,824 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:10:06,960 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 03:10:07,080 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-09-10 03:10:07,207 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-09-10 03:10:07,318 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-09-10 03:10:07,423 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:10:07,525 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:10:07,742 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-10 03:10:08,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:11,769 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:11,977 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:12,084 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:12,200 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:12,313 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:12,431 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:12,549 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:12,665 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:10:12,775 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:10:12,881 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:10:14,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:17,190 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:17,403 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:17,508 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:26,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:29,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:34,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:38,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:40,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:40,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:40,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:40,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-10 03:10:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 44 [2019-09-10 03:10:41,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:41,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 03:10:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 03:10:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:10:41,165 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2019-09-10 03:10:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:41,497 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-09-10 03:10:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 03:10:41,498 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-10 03:10:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:41,499 INFO L225 Difference]: With dead ends: 75 [2019-09-10 03:10:41,499 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 03:10:41,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 213 SyntacticMatches, 41 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1365, Invalid=2667, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 03:10:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 03:10:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 03:10:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 03:10:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-10 03:10:41,507 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2019-09-10 03:10:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:41,507 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-10 03:10:41,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 03:10:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-10 03:10:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:10:41,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:41,509 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:41,509 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2019-09-10 03:10:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:41,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:10:42,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:42,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:42,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:42,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:42,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:42,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:42,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:42,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 03:10:42,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:42,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-10 03:10:42,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:10:42,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:10:45,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:45,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2019-09-10 03:10:45,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:45,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 03:10:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 03:10:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:10:45,981 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 45 states. [2019-09-10 03:10:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:46,924 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-10 03:10:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:10:46,925 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 133 [2019-09-10 03:10:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:46,926 INFO L225 Difference]: With dead ends: 80 [2019-09-10 03:10:46,926 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 03:10:46,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:10:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 03:10:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-10 03:10:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 03:10:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-10 03:10:46,933 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2019-09-10 03:10:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:46,933 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-10 03:10:46,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 03:10:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-10 03:10:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 03:10:46,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:46,935 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:46,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1226192145, now seen corresponding path program 21 times [2019-09-10 03:10:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:46,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:46,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 42 proven. 691 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2019-09-10 03:10:47,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:47,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:47,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:47,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:47,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:47,612 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) [2019-09-10 03:10:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:47,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:47,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:47,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 03:10:47,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 03:10:48,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:51,327 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:10:51,430 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:10:51,543 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:51,649 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:10:51,765 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:51,876 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:10:51,994 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:52,106 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:10:52,229 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:52,357 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:10:52,487 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:10:52,614 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:10:52,743 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:10:52,874 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:10:53,012 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:10:53,147 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:10:53,294 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:10:53,438 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:10:53,597 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-09-10 03:10:53,744 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-09-10 03:10:53,896 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-10 03:10:54,042 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-10 03:10:54,211 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-10 03:10:54,376 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-10 03:10:54,540 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-10 03:10:54,711 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-10 03:10:54,872 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-09-10 03:10:55,020 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2019-09-10 03:10:55,174 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-09-10 03:10:55,318 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-09-10 03:10:55,458 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-09-10 03:10:55,603 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-09-10 03:10:55,739 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-10 03:10:55,861 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-09-10 03:10:55,991 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-09-10 03:10:56,109 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:10:56,219 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 03:10:56,330 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 03:10:56,435 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-10 03:11:00,521 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:00,726 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:00,834 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:00,940 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:01,050 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:01,178 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:01,293 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:01,417 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:01,538 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:01,669 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:01,798 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:01,935 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:02,073 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:02,207 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:11:02,343 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:11:02,494 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:11:02,635 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:11:02,786 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-09-10 03:11:02,933 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-09-10 03:11:03,095 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-10 03:11:03,254 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-10 03:11:03,410 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-09-10 03:11:03,555 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-09-10 03:11:03,698 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-09-10 03:11:03,834 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-10 03:11:03,968 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-09-10 03:11:04,098 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-09-10 03:11:04,215 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-09-10 03:11:04,330 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:11:04,443 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:11:04,554 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 03:11:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:08,067 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-09-10 03:11:08,805 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:09,013 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:09,121 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:09,237 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:09,350 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:09,466 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:09,576 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:09,700 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:09,819 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:09,956 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:10,089 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:10,224 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:10,356 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:10,491 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:11:10,629 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 03:11:10,778 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:11:10,918 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 03:11:11,064 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-09-10 03:11:11,199 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-09-10 03:11:11,324 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 03:11:11,452 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-09-10 03:11:11,567 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:11:11,681 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:11:11,790 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:11:11,898 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:11:12,001 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-09-10 03:11:13,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:15,956 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:11:16,157 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:16,360 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:16,472 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:16,601 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:16,712 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:16,846 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:16,961 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:17,084 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:17,200 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:17,334 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:17,466 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 03:11:17,597 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:17,726 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 03:11:17,864 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 03:11:17,988 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-09-10 03:11:18,102 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-09-10 03:11:18,213 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:11:18,321 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:11:18,428 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-09-10 03:11:19,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:22,889 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:22,999 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:23,110 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:23,222 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:23,340 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:23,458 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-10 03:11:23,582 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:23,703 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 03:11:23,827 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 03:11:23,935 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-10 03:11:24,046 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 03:11:24,153 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:11:25,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,932 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-10 03:11:28,326 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:28,428 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:28,539 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:28,645 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-10 03:11:28,757 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:28,869 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-10 03:11:28,977 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 03:11:29,089 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-09-10 03:11:29,190 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 03:11:30,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:33,074 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-10 03:11:33,273 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:33,376 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 03:11:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:44,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:49,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:50,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:51,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:52,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:52,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 672 proven. 441 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-10 03:11:53,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:11:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [27, 47] total 73 [2019-09-10 03:11:53,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:11:53,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:11:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:11:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=4306, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:11:53,859 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2019-09-10 03:11:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:54,358 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-10 03:11:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 03:11:54,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2019-09-10 03:11:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:54,361 INFO L225 Difference]: With dead ends: 74 [2019-09-10 03:11:54,361 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:11:54,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 207 SyntacticMatches, 45 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2215, Invalid=6715, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 03:11:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:11:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:11:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:11:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:11:54,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2019-09-10 03:11:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:54,364 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:11:54,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:11:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:11:54,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:11:54,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:11:54 BoogieIcfgContainer [2019-09-10 03:11:54,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:11:54,371 INFO L168 Benchmark]: Toolchain (without parser) took 324550.33 ms. Allocated memory was 135.8 MB in the beginning and 220.2 MB in the end (delta: 84.4 MB). Free memory was 92.1 MB in the beginning and 32.6 MB in the end (delta: 59.5 MB). Peak memory consumption was 143.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,372 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.45 ms. Allocated memory is still 135.8 MB. Free memory was 91.9 MB in the beginning and 83.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,374 INFO L168 Benchmark]: Boogie Preprocessor took 100.26 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 83.0 MB in the beginning and 178.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,375 INFO L168 Benchmark]: RCFGBuilder took 190.69 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 167.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,375 INFO L168 Benchmark]: TraceAbstraction took 324028.62 ms. Allocated memory was 200.8 MB in the beginning and 220.2 MB in the end (delta: 19.4 MB). Free memory was 166.8 MB in the beginning and 32.6 MB in the end (delta: 134.2 MB). Peak memory consumption was 153.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:11:54,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.45 ms. Allocated memory is still 135.8 MB. Free memory was 91.9 MB in the beginning and 83.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.26 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 83.0 MB in the beginning and 178.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 190.69 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 167.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 324028.62 ms. Allocated memory was 200.8 MB in the beginning and 220.2 MB in the end (delta: 19.4 MB). Free memory was 166.8 MB in the beginning and 32.6 MB in the end (delta: 134.2 MB). Peak memory consumption was 153.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 323.9s OverallTime, 22 OverallIterations, 22 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 527 SDslu, 4126 SDs, 0 SdLazy, 2686 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4100 GetRequests, 2809 SyntacticMatches, 468 SemanticMatches, 823 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10378 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 316.4s InterpolantComputationTime, 3331 NumberOfCodeBlocks, 3331 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 4926 ConstructedInterpolants, 0 QuantifiedInterpolants, 1482948 SizeOfPredicates, 252 NumberOfNonLiveVariables, 3885 ConjunctsInSsa, 589 ConjunctsInUnsatCore, 64 InterpolantComputations, 2 PerfectInterpolantSequences, 13660/30492 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...