java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:16:55,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:16:55,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:16:55,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:16:55,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:16:55,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:16:55,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:16:55,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:16:55,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:16:55,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:16:55,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:16:55,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:16:55,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:16:55,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:16:55,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:16:55,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:16:55,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:16:55,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:16:55,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:16:55,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:16:55,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:16:55,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:16:55,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:16:55,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:16:55,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:16:55,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:16:55,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:16:55,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:16:55,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:16:55,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:16:55,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:16:55,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:16:55,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:16:55,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:16:55,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:16:55,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:16:55,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:16:55,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:16:55,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:16:55,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:16:55,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:16:55,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:16:55,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:16:55,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:16:55,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:16:55,941 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:16:55,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:16:55,942 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:16:55,942 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:16:55,942 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:16:55,942 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:16:55,942 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:16:55,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:16:55,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:16:55,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:16:55,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:16:55,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:16:55,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:16:55,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:16:55,947 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:16:55,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:16:55,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:16:55,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:16:55,947 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:16:55,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:16:55,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:16:55,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:16:55,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:16:55,949 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:16:55,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:16:55,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:16:55,949 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:16:56,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:16:56,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:16:56,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:16:56,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:16:56,033 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:16:56,034 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-10 02:16:56,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc1035a4/31a516e30c214b318c9bc96bd5fbfd4d/FLAG82fde03d0 [2019-09-10 02:16:56,544 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:16:56,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-10 02:16:56,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc1035a4/31a516e30c214b318c9bc96bd5fbfd4d/FLAG82fde03d0 [2019-09-10 02:16:56,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc1035a4/31a516e30c214b318c9bc96bd5fbfd4d [2019-09-10 02:16:56,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:16:56,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:16:56,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:16:56,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:16:56,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:16:56,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:16:56" (1/1) ... [2019-09-10 02:16:56,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b75b578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:56, skipping insertion in model container [2019-09-10 02:16:56,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:16:56" (1/1) ... [2019-09-10 02:16:56,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:16:56,980 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:16:57,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:16:57,169 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:16:57,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:16:57,202 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:16:57,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57 WrapperNode [2019-09-10 02:16:57,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:16:57,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:16:57,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:16:57,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:16:57,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... [2019-09-10 02:16:57,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:16:57,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:16:57,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:16:57,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:16:57,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:16:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:16:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:16:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:16:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:16:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:16:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:16:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:16:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:16:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:16:57,560 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:16:57,561 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:16:57,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:16:57 BoogieIcfgContainer [2019-09-10 02:16:57,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:16:57,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:16:57,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:16:57,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:16:57,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:16:56" (1/3) ... [2019-09-10 02:16:57,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658d5e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:16:57, skipping insertion in model container [2019-09-10 02:16:57,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:16:57" (2/3) ... [2019-09-10 02:16:57,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658d5e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:16:57, skipping insertion in model container [2019-09-10 02:16:57,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:16:57" (3/3) ... [2019-09-10 02:16:57,573 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2019-09-10 02:16:57,596 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:16:57,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:16:57,625 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:16:57,656 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:16:57,656 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:16:57,656 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:16:57,657 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:16:57,657 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:16:57,657 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:16:57,657 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:16:57,657 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:16:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 02:16:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:16:57,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:57,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:57,686 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2019-09-10 02:16:57,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:57,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:57,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:16:57,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:16:57,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:57,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:16:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:16:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:16:57,818 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-10 02:16:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:57,834 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-10 02:16:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:16:57,835 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:16:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:57,843 INFO L225 Difference]: With dead ends: 20 [2019-09-10 02:16:57,844 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 02:16:57,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:16:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 02:16:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 02:16:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 02:16:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-10 02:16:57,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-10 02:16:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:57,877 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-10 02:16:57,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:16:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-10 02:16:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:16:57,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:57,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:57,878 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2019-09-10 02:16:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:57,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:58,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:16:58,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:16:58,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:58,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:16:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:16:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:58,011 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-10 02:16:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:58,043 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-10 02:16:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:16:58,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:16:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:58,044 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:16:58,044 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:16:58,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:16:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-10 02:16:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 02:16:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 02:16:58,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 02:16:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:58,050 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 02:16:58,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:16:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 02:16:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:16:58,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:58,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:58,051 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2019-09-10 02:16:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:58,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:16:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:16:58,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:58,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:16:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:16:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:58,137 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-10 02:16:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:58,160 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-10 02:16:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:16:58,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 02:16:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:58,162 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:16:58,162 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:16:58,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:16:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:16:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-10 02:16:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 02:16:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-10 02:16:58,166 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-10 02:16:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:58,167 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-10 02:16:58,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:16:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-10 02:16:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:16:58,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:58,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:58,168 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2019-09-10 02:16:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:58,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:58,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:58,356 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 02:16:58,358 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-10 02:16:58,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:16:58,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:16:58,488 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:16:58,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:16:58,571 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 86 root evaluator evaluations with a maximum evaluation depth of 6. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 02:16:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:58,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:16:58,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:58,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:58,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:58,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:16:58,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:58,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:58,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:58,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-09-10 02:16:58,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:58,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:16:58,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:16:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:16:58,756 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-10 02:16:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:58,827 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 02:16:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:16:58,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 02:16:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:58,831 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:16:58,831 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:16:58,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:16:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:16:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-10 02:16:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 02:16:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 02:16:58,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 02:16:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:58,839 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 02:16:58,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:16:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 02:16:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:16:58,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:58,841 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:58,841 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash 199799702, now seen corresponding path program 2 times [2019-09-10 02:16:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:59,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:59,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:59,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:59,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,032 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 02:16:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:59,054 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 02:16:59,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-09-10 02:16:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:59,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:16:59,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:16:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:16:59,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:16:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:16:59,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 14 [2019-09-10 02:16:59,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:16:59,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:16:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:16:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:16:59,324 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-10 02:16:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:59,402 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-09-10 02:16:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:16:59,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-10 02:16:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:59,404 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:16:59,404 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 02:16:59,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:16:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 02:16:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 02:16:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:16:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-10 02:16:59,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-10 02:16:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:59,409 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-10 02:16:59,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:16:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-10 02:16:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:16:59,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:59,410 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:59,410 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1075985333, now seen corresponding path program 1 times [2019-09-10 02:16:59,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:59,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:59,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:59,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:59,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 02:16:59,499 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-10 02:16:59,500 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:16:59,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:16:59,503 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:16:59,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:16:59,551 INFO L272 AbstractInterpreter]: Visited 14 different actions 72 times. Merged at 5 different actions 28 times. Widened at 1 different actions 4 times. Performed 139 root evaluator evaluations with a maximum evaluation depth of 6. Performed 139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-10 02:16:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:59,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:16:59,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:59,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:16:59,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:59,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:59,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 02:16:59,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:59,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:16:59,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:16:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:16:59,652 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-09-10 02:16:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:59,705 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-10 02:16:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:16:59,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 02:16:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:59,707 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:16:59,707 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:16:59,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:16:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:16:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-10 02:16:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:16:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-10 02:16:59,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-09-10 02:16:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:59,712 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-10 02:16:59,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:16:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-10 02:16:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:16:59,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:59,713 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:59,714 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133644, now seen corresponding path program 2 times [2019-09-10 02:16:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:59,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:59,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:16:59,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:59,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:59,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:59,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:16:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:59,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:59,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:16:59,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:59,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:16:59,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:16:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:16:59,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:00,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:00,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2019-09-10 02:17:00,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:00,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:17:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:17:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:17:00,125 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-09-10 02:17:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:00,360 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-10 02:17:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:17:00,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-09-10 02:17:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:00,361 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:17:00,362 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:17:00,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:17:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:17:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-10 02:17:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:17:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-10 02:17:00,371 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-09-10 02:17:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:00,371 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-10 02:17:00,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:17:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-10 02:17:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:17:00,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:00,373 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:00,373 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2062781546, now seen corresponding path program 3 times [2019-09-10 02:17:00,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:00,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:00,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:00,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:00,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:00,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:00,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:00,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:00,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:00,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:00,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:00,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:00,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:00,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:17:00,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:00,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:00,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:00,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 02:17:00,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:00,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:17:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:17:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:00,698 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-09-10 02:17:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:00,814 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-10 02:17:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:17:00,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-10 02:17:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:00,816 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:17:00,816 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:17:00,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:17:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-10 02:17:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:17:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-10 02:17:00,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-09-10 02:17:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-10 02:17:00,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:17:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-10 02:17:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:17:00,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:00,822 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:00,822 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1147963575, now seen corresponding path program 4 times [2019-09-10 02:17:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:00,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:00,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:00,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:00,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:00,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:00,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:00,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:00,931 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) [2019-09-10 02:17:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:00,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:00,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:17:00,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:00,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:01,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:01,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 02:17:01,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:01,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:17:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:17:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:17:01,135 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2019-09-10 02:17:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:01,270 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-10 02:17:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:17:01,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-10 02:17:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:01,271 INFO L225 Difference]: With dead ends: 37 [2019-09-10 02:17:01,271 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:17:01,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:17:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:17:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-10 02:17:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 02:17:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-09-10 02:17:01,276 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 31 [2019-09-10 02:17:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:01,276 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-09-10 02:17:01,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:17:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-09-10 02:17:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:17:01,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:01,277 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:01,277 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -760785930, now seen corresponding path program 5 times [2019-09-10 02:17:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:01,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:01,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:01,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:01,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:01,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:01,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:01,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:01,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:01,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:01,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:17:01,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:01,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:17:01,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:01,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:17:01,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:17:01,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2019-09-10 02:17:01,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:17:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:17:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:17:01,814 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2019-09-10 02:17:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:02,265 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-10 02:17:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:17:02,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-10 02:17:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:02,267 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:17:02,267 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:17:02,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:17:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:17:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-10 02:17:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:17:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-10 02:17:02,272 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-09-10 02:17:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:02,272 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-10 02:17:02,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:17:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-10 02:17:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:17:02,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:02,274 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:02,274 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1911185236, now seen corresponding path program 6 times [2019-09-10 02:17:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:02,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:02,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:02,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:02,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:02,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:02,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:02,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:02,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:02,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:02,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:02,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:17:02,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:02,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:02,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:02,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2019-09-10 02:17:02,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:02,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:17:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:17:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:17:02,801 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 13 states. [2019-09-10 02:17:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:03,103 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-10 02:17:03,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:17:03,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-10 02:17:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:03,105 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:17:03,105 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 02:17:03,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:17:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 02:17:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-10 02:17:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:17:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-10 02:17:03,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 40 [2019-09-10 02:17:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:03,113 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-10 02:17:03,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:17:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-10 02:17:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 02:17:03,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:03,115 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:03,115 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1672683157, now seen corresponding path program 7 times [2019-09-10 02:17:03,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:03,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:03,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 58 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:03,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:03,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:03,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:03,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:03,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:03,326 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) [2019-09-10 02:17:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:03,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:03,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:17:03,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:17:03,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:17:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:03,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2019-09-10 02:17:03,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:03,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:17:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:17:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:17:03,712 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 14 states. [2019-09-10 02:17:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:04,052 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-09-10 02:17:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:17:04,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-10 02:17:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:04,054 INFO L225 Difference]: With dead ends: 58 [2019-09-10 02:17:04,055 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:17:04,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:17:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:17:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-10 02:17:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:17:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-09-10 02:17:04,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 49 [2019-09-10 02:17:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:04,061 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-09-10 02:17:04,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:17:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-09-10 02:17:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 02:17:04,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:04,062 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:04,063 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash -271959499, now seen corresponding path program 8 times [2019-09-10 02:17:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:04,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:04,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:04,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:04,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:04,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:04,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:04,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:17:04,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:04,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:17:04,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 02:17:07,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 38 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 02:17:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-09-10 02:17:25,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:25,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:17:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:17:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1068, Unknown=7, NotChecked=0, Total=1260 [2019-09-10 02:17:25,805 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 26 states. [2019-09-10 02:17:40,486 WARN L188 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 02:17:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:40,592 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-10 02:17:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:17:40,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-09-10 02:17:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:40,596 INFO L225 Difference]: With dead ends: 74 [2019-09-10 02:17:40,596 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:17:40,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=408, Invalid=2341, Unknown=7, NotChecked=0, Total=2756 [2019-09-10 02:17:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:17:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-10 02:17:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:17:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-10 02:17:40,603 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2019-09-10 02:17:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:40,603 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-10 02:17:40,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:17:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-10 02:17:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:17:40,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:40,604 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:40,605 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:40,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:40,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1938737898, now seen corresponding path program 9 times [2019-09-10 02:17:40,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:40,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:40,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:40,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:40,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 83 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:40,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:40,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:40,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:40,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:40,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:40,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:40,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:40,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:40,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:40,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 02:17:40,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:40,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 34 [2019-09-10 02:17:41,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:41,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:17:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:17:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:17:41,552 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 19 states. [2019-09-10 02:17:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:42,328 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2019-09-10 02:17:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:17:42,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2019-09-10 02:17:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:42,330 INFO L225 Difference]: With dead ends: 79 [2019-09-10 02:17:42,330 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 02:17:42,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:17:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 02:17:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-10 02:17:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 02:17:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-09-10 02:17:42,337 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 64 [2019-09-10 02:17:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:42,337 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-09-10 02:17:42,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:17:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-09-10 02:17:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 02:17:42,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:42,339 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:42,339 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1072726359, now seen corresponding path program 10 times [2019-09-10 02:17:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:42,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:42,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 98 proven. 551 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:42,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:42,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:42,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:42,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:42,772 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 02:17:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:42,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:42,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:17:42,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:42,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:43,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:43,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2019-09-10 02:17:43,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:43,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:17:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:17:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:17:43,699 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2019-09-10 02:17:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:44,542 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-10 02:17:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:17:44,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2019-09-10 02:17:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:44,544 INFO L225 Difference]: With dead ends: 88 [2019-09-10 02:17:44,545 INFO L226 Difference]: Without dead ends: 88 [2019-09-10 02:17:44,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:17:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-10 02:17:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-10 02:17:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 02:17:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-09-10 02:17:44,551 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 73 [2019-09-10 02:17:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:44,551 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-09-10 02:17:44,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:17:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-09-10 02:17:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 02:17:44,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:44,553 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 20, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:44,553 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -544444874, now seen corresponding path program 11 times [2019-09-10 02:17:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:44,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 113 proven. 737 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:17:45,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:45,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:45,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:45,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:45,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:45,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:45,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:45,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:45,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:17:45,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:45,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:17:45,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:45,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 02:17:45,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 02:17:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 47 [2019-09-10 02:17:52,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:52,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:17:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:17:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:17:52,087 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 36 states. [2019-09-10 02:17:56,664 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-09-10 02:17:57,577 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-09-10 02:17:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:57,730 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-09-10 02:17:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:17:57,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2019-09-10 02:17:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:57,734 INFO L225 Difference]: With dead ends: 107 [2019-09-10 02:17:57,734 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:17:57,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=598, Invalid=4804, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:17:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:17:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-09-10 02:17:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 02:17:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-10 02:17:57,742 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 82 [2019-09-10 02:17:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:57,742 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-10 02:17:57,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:17:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-10 02:17:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:17:57,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:57,744 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:57,744 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 119959157, now seen corresponding path program 12 times [2019-09-10 02:17:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:57,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:57,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:58,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:58,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:58,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:58,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:58,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:58,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:58,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:58,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:58,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:58,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:58,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 02:17:58,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:58,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:17:59,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 02:17:59,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:59,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:17:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:17:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:17:59,924 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 27 states. [2019-09-10 02:18:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:01,342 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-10 02:18:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:18:01,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 91 [2019-09-10 02:18:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:01,345 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:18:01,345 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 02:18:01,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:18:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 02:18:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-10 02:18:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-10 02:18:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-10 02:18:01,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 91 [2019-09-10 02:18:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:01,351 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-10 02:18:01,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:18:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-10 02:18:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:18:01,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:01,353 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 25, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:01,353 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 463026484, now seen corresponding path program 13 times [2019-09-10 02:18:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:01,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:01,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:02,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:02,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:02,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:02,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:02,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:02,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:18:02,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:02,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:02,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:18:02,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:02,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:03,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:03,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 02:18:03,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:03,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:18:03,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:18:03,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:18:03,709 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 28 states. [2019-09-10 02:18:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:05,235 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-10 02:18:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:18:05,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-10 02:18:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:05,237 INFO L225 Difference]: With dead ends: 108 [2019-09-10 02:18:05,237 INFO L226 Difference]: Without dead ends: 108 [2019-09-10 02:18:05,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:18:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-10 02:18:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-10 02:18:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-10 02:18:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-10 02:18:05,243 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2019-09-10 02:18:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:05,244 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-10 02:18:05,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:18:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-10 02:18:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:18:05,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:05,245 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 26, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:05,245 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1240399339, now seen corresponding path program 14 times [2019-09-10 02:18:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:05,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 282 proven. 950 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:05,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:05,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:05,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:05,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,785 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 02:18:05,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:05,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:05,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:18:05,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:05,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:18:05,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-10 02:18:06,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-10 02:18:07,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:07,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 8] total 39 [2019-09-10 02:18:07,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:07,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:18:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:18:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:18:07,665 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 33 states. [2019-09-10 02:18:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:11,058 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-09-10 02:18:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:18:11,058 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2019-09-10 02:18:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:11,059 INFO L225 Difference]: With dead ends: 124 [2019-09-10 02:18:11,059 INFO L226 Difference]: Without dead ends: 124 [2019-09-10 02:18:11,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=607, Invalid=3683, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:18:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-10 02:18:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2019-09-10 02:18:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-10 02:18:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-10 02:18:11,065 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 97 [2019-09-10 02:18:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:11,065 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-10 02:18:11,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:18:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-10 02:18:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:18:11,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:11,067 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 27, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:11,067 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash 500456500, now seen corresponding path program 15 times [2019-09-10 02:18:11,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:11,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:11,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 153 proven. 1365 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:11,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:11,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:11,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:11,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:11,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:11,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:11,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:11,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 02:18:11,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:11,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:13,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 61 [2019-09-10 02:18:13,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:13,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:18:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:18:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:18:13,954 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 33 states. [2019-09-10 02:18:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:16,061 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-09-10 02:18:16,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:18:16,065 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-10 02:18:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:16,066 INFO L225 Difference]: With dead ends: 124 [2019-09-10 02:18:16,066 INFO L226 Difference]: Without dead ends: 124 [2019-09-10 02:18:16,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:18:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-10 02:18:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-10 02:18:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-10 02:18:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-10 02:18:16,073 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 106 [2019-09-10 02:18:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:16,074 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-10 02:18:16,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:18:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-10 02:18:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:18:16,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:16,075 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 31, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:16,076 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1068497676, now seen corresponding path program 16 times [2019-09-10 02:18:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:16,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:16,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 173 proven. 1751 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:16,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:16,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:16,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:16,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:16,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:16,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:16,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:16,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-10 02:18:16,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:17,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:18:19,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:19,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34, 34] total 69 [2019-09-10 02:18:19,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:19,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:18:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:18:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:18:19,294 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 37 states. [2019-09-10 02:18:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:22,027 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-09-10 02:18:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:18:22,028 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 118 [2019-09-10 02:18:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:22,029 INFO L225 Difference]: With dead ends: 136 [2019-09-10 02:18:22,030 INFO L226 Difference]: Without dead ends: 136 [2019-09-10 02:18:22,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:18:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-10 02:18:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-10 02:18:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-10 02:18:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-10 02:18:22,036 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 118 [2019-09-10 02:18:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:22,036 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-10 02:18:22,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:18:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-10 02:18:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:18:22,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:22,038 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:22,038 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:22,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1624542644, now seen corresponding path program 17 times [2019-09-10 02:18:22,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:22,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 193 proven. 2185 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:23,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:23,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:23,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:23,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:23,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:23,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:23,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:23,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:23,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:18:23,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:23,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:18:23,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:25,375 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-09-10 02:18:25,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-09-10 02:18:25,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:29,728 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 02:18:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:18:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 67 [2019-09-10 02:18:35,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:35,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:18:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:18:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=3978, Unknown=1, NotChecked=0, Total=4422 [2019-09-10 02:18:35,585 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 54 states. [2019-09-10 02:18:49,767 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-09-10 02:18:50,337 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 02:18:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:50,536 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2019-09-10 02:18:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:18:50,538 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 130 [2019-09-10 02:18:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:50,539 INFO L225 Difference]: With dead ends: 157 [2019-09-10 02:18:50,539 INFO L226 Difference]: Without dead ends: 154 [2019-09-10 02:18:50,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1139, Invalid=10631, Unknown=2, NotChecked=0, Total=11772 [2019-09-10 02:18:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-10 02:18:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-09-10 02:18:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:18:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-09-10 02:18:50,544 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 130 [2019-09-10 02:18:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:50,545 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-09-10 02:18:50,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:18:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-09-10 02:18:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:18:50,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:50,546 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 39, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:50,546 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 348038167, now seen corresponding path program 18 times [2019-09-10 02:18:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:50,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:50,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 218 proven. 2795 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:18:52,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:52,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:52,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:52,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:52,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:52,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:52,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:52,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:52,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:52,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-10 02:18:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:52,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 02:18:55,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:55,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 44] total 88 [2019-09-10 02:18:55,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:55,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:18:55,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:18:55,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:18:55,928 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 46 states. [2019-09-10 02:19:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:00,203 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-09-10 02:19:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:19:00,203 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 145 [2019-09-10 02:19:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:00,205 INFO L225 Difference]: With dead ends: 166 [2019-09-10 02:19:00,205 INFO L226 Difference]: Without dead ends: 166 [2019-09-10 02:19:00,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:19:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-10 02:19:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-10 02:19:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-10 02:19:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-09-10 02:19:00,210 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 145 [2019-09-10 02:19:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:00,210 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-09-10 02:19:00,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:19:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-09-10 02:19:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:19:00,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:00,212 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 44, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:00,212 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1151450538, now seen corresponding path program 19 times [2019-09-10 02:19:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:00,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:00,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 243 proven. 3480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:19:01,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:01,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:01,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:01,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 02:19:01,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:01,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:01,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:19:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:01,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-10 02:19:01,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:01,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:06,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:06,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 96 [2019-09-10 02:19:06,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:06,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:19:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:19:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:19:06,179 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 51 states. [2019-09-10 02:19:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:11,446 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2019-09-10 02:19:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:19:11,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 160 [2019-09-10 02:19:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:11,448 INFO L225 Difference]: With dead ends: 181 [2019-09-10 02:19:11,448 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 02:19:11,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:19:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 02:19:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-10 02:19:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:19:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2019-09-10 02:19:11,453 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 160 [2019-09-10 02:19:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:11,453 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2019-09-10 02:19:11,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:19:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2019-09-10 02:19:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 02:19:11,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:11,455 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 49, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:11,455 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1397457353, now seen corresponding path program 20 times [2019-09-10 02:19:11,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:11,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 268 proven. 4240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:19:13,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:13,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:13,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:13,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:13,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:13,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:13,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:19:13,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:19:14,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:19:14,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:14,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:19:14,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:19:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-10 02:19:15,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 882 refuted. 2 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-10 02:19:40,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:40,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 15, 15] total 82 [2019-09-10 02:19:40,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:40,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:19:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:19:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=6255, Unknown=7, NotChecked=0, Total=6642 [2019-09-10 02:19:40,701 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 69 states. [2019-09-10 02:19:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:56,876 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2019-09-10 02:19:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:19:56,876 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2019-09-10 02:19:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:56,878 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:19:56,879 INFO L226 Difference]: Without dead ends: 202 [2019-09-10 02:19:56,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=1345, Invalid=18108, Unknown=7, NotChecked=0, Total=19460 [2019-09-10 02:19:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-10 02:19:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-10 02:19:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-10 02:19:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2019-09-10 02:19:56,885 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 175 [2019-09-10 02:19:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:56,886 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2019-09-10 02:19:56,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:19:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2019-09-10 02:19:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:19:56,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:56,887 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 54, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:56,887 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:56,888 INFO L82 PathProgramCache]: Analyzing trace with hash -760166635, now seen corresponding path program 21 times [2019-09-10 02:19:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:56,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:56,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 298 proven. 5251 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:19:58,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:58,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:58,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:58,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:58,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:58,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:19:58,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:19:59,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:19:59,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:59,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-10 02:19:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:19:59,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:20:05,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:05,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 57, 57] total 117 [2019-09-10 02:20:05,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:05,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:20:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:20:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 02:20:05,956 INFO L87 Difference]: Start difference. First operand 198 states and 202 transitions. Second operand 62 states. [2019-09-10 02:20:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:14,047 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2019-09-10 02:20:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:20:14,052 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 193 [2019-09-10 02:20:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:14,054 INFO L225 Difference]: With dead ends: 217 [2019-09-10 02:20:14,054 INFO L226 Difference]: Without dead ends: 217 [2019-09-10 02:20:14,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 331 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 02:20:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-10 02:20:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-09-10 02:20:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-10 02:20:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-09-10 02:20:14,059 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 193 [2019-09-10 02:20:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:14,060 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-09-10 02:20:14,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:20:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-09-10 02:20:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:20:14,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:14,061 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 60, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:14,062 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:14,062 INFO L82 PathProgramCache]: Analyzing trace with hash 24031733, now seen corresponding path program 22 times [2019-09-10 02:20:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:14,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:14,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 328 proven. 6370 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:20:16,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:16,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:16,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:16,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:16,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:16,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:16,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:16,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-10 02:20:16,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:20:16,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:20:24,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:24,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 63, 63] total 129 [2019-09-10 02:20:24,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:24,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:20:24,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:20:24,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 02:20:24,909 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 68 states. [2019-09-10 02:20:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:34,657 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2019-09-10 02:20:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 02:20:34,658 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 211 [2019-09-10 02:20:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:34,659 INFO L225 Difference]: With dead ends: 235 [2019-09-10 02:20:34,659 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 02:20:34,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 02:20:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 02:20:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-09-10 02:20:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-10 02:20:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 238 transitions. [2019-09-10 02:20:34,665 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 238 transitions. Word has length 211 [2019-09-10 02:20:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:34,665 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 238 transitions. [2019-09-10 02:20:34,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:20:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2019-09-10 02:20:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 02:20:34,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:34,667 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 66, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:34,667 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1923373867, now seen corresponding path program 23 times [2019-09-10 02:20:34,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:34,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:34,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:34,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 358 proven. 7597 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:20:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:37,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:37,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:20:37,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:20:42,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:20:42,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:42,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:20:42,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:43,651 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 02:20:43,905 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-09-10 02:20:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-10 02:20:46,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:51,142 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 02:21:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-10 02:21:12,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 17, 17] total 104 [2019-09-10 02:21:12,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:12,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 02:21:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 02:21:12,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=9982, Unknown=4, NotChecked=0, Total=10712 [2019-09-10 02:21:12,311 INFO L87 Difference]: Start difference. First operand 234 states and 238 transitions. Second operand 89 states. [2019-09-10 02:21:41,044 WARN L188 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 02:21:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:41,312 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2019-09-10 02:21:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:21:41,312 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 229 [2019-09-10 02:21:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:41,314 INFO L225 Difference]: With dead ends: 262 [2019-09-10 02:21:41,315 INFO L226 Difference]: Without dead ends: 259 [2019-09-10 02:21:41,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3102 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=2131, Invalid=29726, Unknown=5, NotChecked=0, Total=31862 [2019-09-10 02:21:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-10 02:21:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-10 02:21:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 02:21:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 259 transitions. [2019-09-10 02:21:41,321 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 259 transitions. Word has length 229 [2019-09-10 02:21:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:41,322 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 259 transitions. [2019-09-10 02:21:41,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 02:21:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 259 transitions. [2019-09-10 02:21:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 02:21:41,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:41,324 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 72, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:41,324 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash -568596682, now seen corresponding path program 24 times [2019-09-10 02:21:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:41,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:41,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 393 proven. 9165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:21:44,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:44,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:21:44,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:44,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:44,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:44,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:44,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:21:44,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:21:44,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:21:44,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:21:44,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-10 02:21:44,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:21:45,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:21:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:21:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 75, 75] total 154 [2019-09-10 02:21:57,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:57,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:21:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:21:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:21:57,814 INFO L87 Difference]: Start difference. First operand 255 states and 259 transitions. Second operand 81 states. [2019-09-10 02:22:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:11,857 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2019-09-10 02:22:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 02:22:11,858 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 250 [2019-09-10 02:22:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:11,861 INFO L225 Difference]: With dead ends: 277 [2019-09-10 02:22:11,861 INFO L226 Difference]: Without dead ends: 277 [2019-09-10 02:22:11,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 427 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:22:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-10 02:22:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-09-10 02:22:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-10 02:22:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2019-09-10 02:22:11,868 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 250 [2019-09-10 02:22:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:11,868 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2019-09-10 02:22:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:22:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2019-09-10 02:22:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-10 02:22:11,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:11,870 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 79, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:11,870 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:11,871 INFO L82 PathProgramCache]: Analyzing trace with hash -147337353, now seen corresponding path program 25 times [2019-09-10 02:22:11,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:11,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:11,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 428 proven. 10880 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:22:15,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:15,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:15,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:15,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:15,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:15,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:15,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:22:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:15,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-10 02:22:15,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9401 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:22:16,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9401 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 02:22:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 82, 82] total 168 [2019-09-10 02:22:30,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:30,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 02:22:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 02:22:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7298, Invalid=20758, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 02:22:30,385 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 88 states. [2019-09-10 02:22:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:47,034 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2019-09-10 02:22:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-10 02:22:47,035 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 271 [2019-09-10 02:22:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:47,037 INFO L225 Difference]: With dead ends: 298 [2019-09-10 02:22:47,037 INFO L226 Difference]: Without dead ends: 298 [2019-09-10 02:22:47,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 462 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=7298, Invalid=20758, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 02:22:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-10 02:22:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-10 02:22:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-10 02:22:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2019-09-10 02:22:47,044 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 271 [2019-09-10 02:22:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:47,044 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2019-09-10 02:22:47,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 02:22:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2019-09-10 02:22:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-10 02:22:47,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:47,046 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 86, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:47,047 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2045687338, now seen corresponding path program 26 times [2019-09-10 02:22:47,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:47,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:47,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:47,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:47,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 463 proven. 12742 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:22:51,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:51,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:51,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:51,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:51,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:51,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:51,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:22:51,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:23:18,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:23:18,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:18,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:23:18,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-10 02:23:20,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-10 02:23:24,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:23:24,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 15, 15] total 121 [2019-09-10 02:23:24,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:24,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-10 02:23:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-10 02:23:24,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=13992, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 02:23:24,181 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 108 states. [2019-09-10 02:23:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:53,993 INFO L93 Difference]: Finished difference Result 331 states and 337 transitions. [2019-09-10 02:23:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-10 02:23:53,993 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 292 [2019-09-10 02:23:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:53,995 INFO L225 Difference]: With dead ends: 331 [2019-09-10 02:23:53,995 INFO L226 Difference]: Without dead ends: 328 [2019-09-10 02:23:53,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 559 SyntacticMatches, 2 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=2128, Invalid=44312, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 02:23:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-10 02:23:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 323. [2019-09-10 02:23:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-10 02:23:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 327 transitions. [2019-09-10 02:23:54,003 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 327 transitions. Word has length 292 [2019-09-10 02:23:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:54,004 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 327 transitions. [2019-09-10 02:23:54,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-10 02:23:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 327 transitions. [2019-09-10 02:23:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 02:23:54,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:54,006 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 93, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:54,006 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -541127980, now seen corresponding path program 27 times [2019-09-10 02:23:54,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 503 proven. 15050 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:23:59,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:59,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:23:59,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:59,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:59,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:59,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:59,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:23:59,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:23:59,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:23:59,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:59,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 189 conjunts are in the unsatisfiable core [2019-09-10 02:23:59,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:23:59,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:24:19,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:24:19,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 96, 96] total 197 [2019-09-10 02:24:19,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:24:19,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-10 02:24:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-10 02:24:19,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-10 02:24:19,356 INFO L87 Difference]: Start difference. First operand 323 states and 327 transitions. Second operand 103 states. [2019-09-10 02:24:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:24:42,410 INFO L93 Difference]: Finished difference Result 348 states and 352 transitions. [2019-09-10 02:24:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-10 02:24:42,410 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 316 [2019-09-10 02:24:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:24:42,413 INFO L225 Difference]: With dead ends: 348 [2019-09-10 02:24:42,414 INFO L226 Difference]: Without dead ends: 348 [2019-09-10 02:24:42,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 538 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-10 02:24:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-10 02:24:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-10 02:24:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 02:24:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2019-09-10 02:24:42,426 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 316 [2019-09-10 02:24:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:24:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2019-09-10 02:24:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-10 02:24:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2019-09-10 02:24:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 02:24:42,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:24:42,429 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 101, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:24:42,429 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:24:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:24:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -155067308, now seen corresponding path program 28 times [2019-09-10 02:24:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:24:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:42,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:24:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:42,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:24:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 543 proven. 17550 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:24:48,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:48,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:24:48,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:24:48,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:24:48,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:48,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:24:48,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:24:48,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:24:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:48,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 205 conjunts are in the unsatisfiable core [2019-09-10 02:24:48,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:24:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:24:48,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:25:12,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:12,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 104, 104] total 213 [2019-09-10 02:25:12,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:12,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-10 02:25:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-10 02:25:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-10 02:25:12,085 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 111 states. [2019-09-10 02:25:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:38,995 INFO L93 Difference]: Finished difference Result 372 states and 376 transitions. [2019-09-10 02:25:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-10 02:25:38,996 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 340 [2019-09-10 02:25:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:38,997 INFO L225 Difference]: With dead ends: 372 [2019-09-10 02:25:38,997 INFO L226 Difference]: Without dead ends: 372 [2019-09-10 02:25:39,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 578 SyntacticMatches, 3 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-10 02:25:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-10 02:25:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2019-09-10 02:25:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-10 02:25:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 375 transitions. [2019-09-10 02:25:39,008 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 375 transitions. Word has length 340 [2019-09-10 02:25:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:39,008 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 375 transitions. [2019-09-10 02:25:39,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-10 02:25:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 375 transitions. [2019-09-10 02:25:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-10 02:25:39,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:39,011 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 109, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:39,011 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:39,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash 784870868, now seen corresponding path program 29 times [2019-09-10 02:25:39,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:39,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:39,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:25:39,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:39,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 583 proven. 20242 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:25:46,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:46,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:46,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:46,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:46,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:46,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:25:46,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:25:46,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:28:49,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:28:49,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:28:51,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:28:51,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:54,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 326 proven. 2951 refuted. 0 times theorem prover too weak. 17550 trivial. 0 not checked. [2019-09-10 02:28:55,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 3277 refuted. 0 times theorem prover too weak. 17550 trivial. 0 not checked. [2019-09-10 02:29:07,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 25, 26] total 166 [2019-09-10 02:29:07,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:07,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-10 02:29:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-10 02:29:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3123, Invalid=24266, Unknown=1, NotChecked=0, Total=27390 [2019-09-10 02:29:07,152 INFO L87 Difference]: Start difference. First operand 371 states and 375 transitions. Second operand 142 states. [2019-09-10 02:30:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:15,661 INFO L93 Difference]: Finished difference Result 435 states and 444 transitions. [2019-09-10 02:30:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-10 02:30:15,662 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 364 [2019-09-10 02:30:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:15,665 INFO L225 Difference]: With dead ends: 435 [2019-09-10 02:30:15,665 INFO L226 Difference]: Without dead ends: 432 [2019-09-10 02:30:15,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 681 SyntacticMatches, 3 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8137 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=6960, Invalid=78011, Unknown=1, NotChecked=0, Total=84972 [2019-09-10 02:30:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-10 02:30:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 419. [2019-09-10 02:30:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-10 02:30:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 425 transitions. [2019-09-10 02:30:15,674 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 425 transitions. Word has length 364 [2019-09-10 02:30:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:15,675 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 425 transitions. [2019-09-10 02:30:15,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-10 02:30:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 425 transitions. [2019-09-10 02:30:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-10 02:30:15,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:15,677 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 118, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:15,678 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1486981258, now seen corresponding path program 30 times [2019-09-10 02:30:15,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:30:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24512 backedges. 633 proven. 23877 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:30:23,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:23,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:30:23,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:30:23,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:30:23,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:23,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:30:23,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:30:23,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:30:23,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:30:23,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:30:23,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 239 conjunts are in the unsatisfiable core [2019-09-10 02:30:23,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:30:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 24512 backedges. 3441 proven. 20945 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 02:30:24,236 INFO L322 TraceCheckSpWp]: Computing backward predicates...