java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:49:43,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:49:43,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:49:43,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:49:43,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:49:43,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:49:43,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:49:43,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:49:43,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:49:43,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:49:43,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:49:43,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:49:43,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:49:43,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:49:43,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:49:43,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:49:43,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:49:43,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:49:43,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:49:43,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:49:43,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:49:43,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:49:43,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:49:43,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:49:43,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:49:43,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:49:43,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:49:43,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:49:43,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:49:43,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:49:43,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:49:43,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:49:43,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:49:43,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:49:43,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:49:43,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:49:43,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:49:43,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:49:43,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:49:43,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:49:43,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:49:43,854 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 01:49:43,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:49:43,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:49:43,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:49:43,870 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:49:43,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:49:43,871 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:49:43,871 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:49:43,871 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:49:43,871 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:49:43,871 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:49:43,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:49:43,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:49:43,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:49:43,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:49:43,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:49:43,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:49:43,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:49:43,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:49:43,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:49:43,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:49:43,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:49:43,875 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:49:43,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:49:43,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:49:43,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:49:43,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:49:43,876 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:49:43,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:49:43,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:49:43,876 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:49:43,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:49:43,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:49:43,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:49:43,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:49:43,932 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:49:43,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-10 01:49:43,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50830e82/2109ef10613f41d2a0ff75a79b870d27/FLAGf93001bb0 [2019-09-10 01:49:44,369 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:49:44,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-10 01:49:44,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50830e82/2109ef10613f41d2a0ff75a79b870d27/FLAGf93001bb0 [2019-09-10 01:49:44,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50830e82/2109ef10613f41d2a0ff75a79b870d27 [2019-09-10 01:49:44,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:49:44,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:49:44,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:44,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:49:44,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:49:44,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:44" (1/1) ... [2019-09-10 01:49:44,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c46a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:44, skipping insertion in model container [2019-09-10 01:49:44,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:44" (1/1) ... [2019-09-10 01:49:44,821 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:49:44,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:49:45,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:45,056 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:49:45,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:45,091 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:49:45,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45 WrapperNode [2019-09-10 01:49:45,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:45,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:49:45,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:49:45,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:49:45,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (1/1) ... [2019-09-10 01:49:45,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:49:45,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:49:45,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:49:45,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:49:45,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (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 01:49:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:49:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:49:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:49:45,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:49:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:49:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:49:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:49:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:49:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:49:45,466 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:49:45,466 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:49:45,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:45 BoogieIcfgContainer [2019-09-10 01:49:45,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:49:45,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:49:45,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:49:45,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:49:45,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:49:44" (1/3) ... [2019-09-10 01:49:45,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f25501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:45, skipping insertion in model container [2019-09-10 01:49:45,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:45" (2/3) ... [2019-09-10 01:49:45,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f25501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:45, skipping insertion in model container [2019-09-10 01:49:45,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:45" (3/3) ... [2019-09-10 01:49:45,476 INFO L109 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2019-09-10 01:49:45,486 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:49:45,493 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:49:45,511 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:49:45,538 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:49:45,538 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:49:45,539 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:49:45,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:49:45,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:49:45,539 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:49:45,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:49:45,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:49:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-10 01:49:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:49:45,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:45,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:45,566 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-10 01:49:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:45,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:45,768 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 01:49:45,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:49:45,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:45,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:49:45,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:49:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:49:45,808 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-10 01:49:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:45,838 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:49:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:49:45,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:49:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:45,850 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:49:45,850 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:49:45,852 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 01:49:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:49:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:49:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:49:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:49:45,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:49:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:45,894 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:49:45,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:49:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:49:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 01:49:45,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:45,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:45,896 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-10 01:49:45,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:45,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:45,981 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 01:49:45,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:45,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:45,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-10 01:49:45,984 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-10 01:49:46,014 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:49:46,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:49:46,073 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:49:46,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:49:46,131 INFO L272 AbstractInterpreter]: Visited 11 different actions 41 times. Merged at 2 different actions 10 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 5. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-10 01:49:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:46,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:49:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:46,135 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 01:49:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:46,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:46,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:49:46,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:46,223 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 01:49:46,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:46,260 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 01:49:46,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:46,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 01:49:46,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:46,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:49:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:49:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:49:46,267 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-10 01:49:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:46,289 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-10 01:49:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:49:46,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-10 01:49:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:46,291 INFO L225 Difference]: With dead ends: 13 [2019-09-10 01:49:46,291 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 01:49:46,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:49:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 01:49:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 01:49:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 01:49:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-10 01:49:46,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-10 01:49:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:46,296 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-10 01:49:46,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:49:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-10 01:49:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:49:46,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:46,297 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:46,297 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-10 01:49:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:46,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:46,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:46,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:46,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:46,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:46,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:46,415 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 01:49:46,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:46,433 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 01:49:46,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:49:46,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:46,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:49:46,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:46,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:49:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:46,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 01:49:46,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:46,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:49:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:49:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:49:46,999 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-10 01:49:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:47,031 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 01:49:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:49:47,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-10 01:49:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:47,032 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:49:47,033 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:49:47,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:49:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:49:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:49:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:49:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 01:49:47,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-10 01:49:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:47,038 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 01:49:47,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:49:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 01:49:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:49:47,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:47,042 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:47,042 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-10 01:49:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:47,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:47,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:47,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:47,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:47,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:47,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:47,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:47,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:47,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:47,174 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 01:49:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:47,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:47,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:47,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:47,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:49:47,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:47,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:47,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:47,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 01:49:47,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:47,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:49:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:49:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:49:47,709 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-10 01:49:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:47,768 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-10 01:49:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:49:47,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 01:49:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:47,769 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:49:47,769 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:49:47,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:49:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:49:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:49:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:49:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 01:49:47,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-10 01:49:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 01:49:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:49:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 01:49:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:49:47,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:47,774 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:47,774 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-10 01:49:47,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:47,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:47,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:47,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:47,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:47,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:47,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:47,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:47,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:47,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:47,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:47,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:49:47,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:47,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 01:49:49,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:49,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:49:49,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:49:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:49:49,728 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-10 01:49:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:49,792 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 01:49:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:49:49,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-10 01:49:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:49,793 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:49:49,794 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:49:49,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:49:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:49:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:49:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:49:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:49:49,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-10 01:49:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:49,804 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:49:49,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:49:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:49:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:49:49,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:49,805 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:49,805 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-10 01:49:49,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:49,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:49,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:49,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:49,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:49,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:49,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:49,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:49,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:49,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:49,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:49:49,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:49,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:49:49,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:49,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:51,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 01:49:51,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:51,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:49:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:49:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:49:51,707 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-10 01:49:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:51,771 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-10 01:49:51,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:49:51,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-10 01:49:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:51,773 INFO L225 Difference]: With dead ends: 17 [2019-09-10 01:49:51,773 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 01:49:51,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:49:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 01:49:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 01:49:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:49:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:49:51,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-10 01:49:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:51,777 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:49:51,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:49:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:49:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:49:51,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:51,778 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:51,778 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-10 01:49:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:51,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:51,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:51,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:51,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:51,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:51,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:51,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:51,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:51,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:51,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:51,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:51,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 01:49:51,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 01:49:56,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:56,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:49:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:49:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:49:56,079 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-10 01:49:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:56,150 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:49:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:49:56,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-10 01:49:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:56,152 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:49:56,152 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:49:56,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:49:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:49:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:49:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:49:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 01:49:56,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-10 01:49:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:56,156 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 01:49:56,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:49:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 01:49:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:49:56,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:56,157 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:56,158 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-10 01:49:56,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:56,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:56,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:56,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:56,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:56,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:56,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:56,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:56,330 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 01:49:56,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:56,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:56,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:49:56,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:56,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 01:50:00,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:00,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:50:00,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:50:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:50:00,141 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-10 01:50:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:00,221 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 01:50:00,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:50:00,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-10 01:50:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:00,222 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:50:00,222 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:50:00,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:50:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:50:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:50:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:50:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 01:50:00,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-10 01:50:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:00,226 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 01:50:00,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:50:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 01:50:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:50:00,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:00,227 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:00,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-10 01:50:00,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:00,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:00,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:00,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:00,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:00,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,373 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) [2019-09-10 01:50:00,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:00,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:00,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 01:50:00,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:00,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:50:00,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:00,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:05,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:05,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 01:50:05,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:05,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:50:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:50:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:50:05,317 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-10 01:50:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:05,420 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:50:05,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:50:05,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-10 01:50:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:05,423 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:50:05,423 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:50:05,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:50:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:50:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:50:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:50:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:50:05,429 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-10 01:50:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:05,430 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:50:05,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:50:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:50:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:50:05,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:05,431 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:05,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-10 01:50:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:05,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:05,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:05,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:05,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:05,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:05,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:05,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:05,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:05,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:50:05,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:05,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:05,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:50:05,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:05,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:12,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 01:50:12,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:12,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:50:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:50:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:50:12,478 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-10 01:50:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:12,592 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-10 01:50:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:50:12,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-10 01:50:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:12,596 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:50:12,596 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 01:50:12,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:50:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 01:50:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 01:50:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:50:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-10 01:50:12,599 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-10 01:50:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:12,599 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-10 01:50:12,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:50:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-10 01:50:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:50:12,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:12,600 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:12,601 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-10 01:50:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:12,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:12,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:12,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:12,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:12,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:12,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:12,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:12,760 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 01:50:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:12,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:50:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:12,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 01:50:12,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:12,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:20,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:20,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 01:50:20,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:20,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 01:50:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 01:50:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:50:20,939 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-10 01:50:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:21,075 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:50:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:50:21,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-10 01:50:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:21,076 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:50:21,076 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:50:21,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:50:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:50:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 01:50:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 01:50:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-10 01:50:21,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-10 01:50:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:21,086 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-10 01:50:21,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 01:50:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-10 01:50:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:50:21,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:21,087 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:21,087 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-10 01:50:21,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:21,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:21,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:21,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:21,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:21,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:21,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:21,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:21,281 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 01:50:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:21,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:50:21,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 01:50:21,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:21,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 01:50:21,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:21,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:36,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:36,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 01:50:36,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:36,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:50:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:50:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:50:36,034 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-10 01:50:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:36,179 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-10 01:50:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:50:36,182 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-10 01:50:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:36,183 INFO L225 Difference]: With dead ends: 23 [2019-09-10 01:50:36,183 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:50:36,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:50:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:50:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:50:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:50:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-10 01:50:36,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-10 01:50:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:36,187 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-10 01:50:36,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:50:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-10 01:50:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:50:36,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:36,188 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:36,188 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-10 01:50:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:36,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:36,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:36,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:36,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:36,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:36,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:36,356 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 01:50:36,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:36,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:50:36,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:36,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:36,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 01:50:36,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:36,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:50:49,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:49,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 01:50:49,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:49,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:50:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:50:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:50:49,884 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-10 01:50:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:50,069 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 01:50:50,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:50:50,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-10 01:50:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:50,070 INFO L225 Difference]: With dead ends: 24 [2019-09-10 01:50:50,070 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:50:50,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:50:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:50:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 01:50:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:50:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-10 01:50:50,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-10 01:50:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:50,074 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-10 01:50:50,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:50:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-10 01:50:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:50:50,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:50,075 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:50,075 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-10 01:50:50,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:50,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:50,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:50,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:50,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:50,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:50,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:50,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:50,288 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 01:50:50,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:50,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:50:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:50,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 01:50:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:50,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 01:51:03,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:03,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:51:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:51:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:51:03,878 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-10 01:51:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:04,041 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-10 01:51:04,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:51:04,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-10 01:51:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:04,042 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:51:04,042 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:51:04,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:51:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:51:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 01:51:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:51:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-10 01:51:04,046 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-10 01:51:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:04,046 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-10 01:51:04,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:51:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-10 01:51:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:51:04,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:04,047 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:04,047 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-10 01:51:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:04,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:04,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:04,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:04,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:04,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:04,271 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 01:51:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:04,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:51:04,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 01:51:04,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:04,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 01:51:04,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:04,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:21,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:21,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 01:51:21,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:21,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:51:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:51:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:51:21,832 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-10 01:51:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:22,049 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 01:51:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:51:22,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-10 01:51:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:22,052 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:51:22,052 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:51:22,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:51:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:51:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:51:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:51:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-10 01:51:22,055 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-10 01:51:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:22,056 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-10 01:51:22,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:51:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-10 01:51:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:51:22,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:22,057 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:22,057 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-10 01:51:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:22,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:22,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:22,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:22,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:22,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:22,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:22,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:22,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:22,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:22,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:22,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:22,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:22,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 01:51:22,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:22,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:40,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:40,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 01:51:40,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:40,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:51:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:51:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:51:40,595 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-10 01:51:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:40,847 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-10 01:51:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 01:51:40,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-10 01:51:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:40,849 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:51:40,849 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:51:40,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:51:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:51:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 01:51:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:51:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 01:51:40,852 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-10 01:51:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:40,852 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 01:51:40,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:51:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 01:51:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:51:40,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:40,853 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:40,854 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-10 01:51:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:40,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:40,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:41,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:41,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:41,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:41,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:41,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:41,088 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 01:51:41,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:41,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:41,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 01:51:41,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:41,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:03,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:03,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 01:52:03,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:03,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 01:52:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 01:52:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:52:03,360 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-10 01:52:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:03,624 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 01:52:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:52:03,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-10 01:52:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:03,624 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:52:03,624 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:52:03,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:52:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:52:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 01:52:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:52:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-10 01:52:03,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-10 01:52:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:03,629 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-10 01:52:03,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 01:52:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-10 01:52:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:52:03,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:03,630 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:03,630 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-10 01:52:03,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:03,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:03,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:03,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:03,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:03,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:03,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:03,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:03,919 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 01:52:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:52:03,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:52:04,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 01:52:04,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:04,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 01:52:04,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:04,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 01:52:30,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:30,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:52:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:52:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:52:30,626 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-10 01:52:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:30,921 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-10 01:52:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:52:30,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-10 01:52:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:30,922 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:52:30,922 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 01:52:30,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:52:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 01:52:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 01:52:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:52:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-10 01:52:30,925 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-10 01:52:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:30,926 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-10 01:52:30,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:52:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-10 01:52:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:52:30,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:30,927 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:30,927 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-10 01:52:30,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:30,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:30,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:31,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:31,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:31,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:31,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:31,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:31,231 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 01:52:31,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:52:31,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:52:31,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:52:31,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:31,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 01:52:31,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:31,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:59,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:59,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 01:52:59,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:59,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 01:52:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 01:52:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:52:59,780 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-10 01:53:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:00,114 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 01:53:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 01:53:00,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-10 01:53:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:00,116 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:53:00,116 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:53:00,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:53:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:53:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 01:53:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 01:53:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-10 01:53:00,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-10 01:53:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:00,120 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-10 01:53:00,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 01:53:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-10 01:53:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:53:00,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:00,121 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:00,121 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-10 01:53:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:00,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:00,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:00,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:00,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:00,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:00,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:00,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:00,428 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) [2019-09-10 01:53:00,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:00,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:00,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 01:53:00,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:00,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 01:53:32,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:53:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:53:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:53:32,879 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-10 01:53:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:33,192 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-10 01:53:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:53:33,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-10 01:53:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:33,193 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:53:33,193 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:53:33,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:53:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:53:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 01:53:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:53:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-10 01:53:33,198 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-10 01:53:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:33,199 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-10 01:53:33,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:53:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-10 01:53:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:53:33,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:33,200 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:33,200 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-10 01:53:33,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:33,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:33,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:33,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:33,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:33,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:33,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:33,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:33,639 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) [2019-09-10 01:53:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:33,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:35,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 01:53:35,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 01:53:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:35,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 01:54:09,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:09,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:54:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:54:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 01:54:09,812 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-10 01:54:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:10,229 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-10 01:54:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:54:10,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-10 01:54:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:10,234 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:54:10,234 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:54:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 01:54:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:54:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-10 01:54:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:54:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-10 01:54:10,240 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-10 01:54:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:10,241 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-10 01:54:10,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:54:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-10 01:54:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:54:10,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:10,244 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:10,245 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-10 01:54:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:10,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:10,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:10,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:10,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:10,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:10,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:10,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:10,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:10,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:10,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:10,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:10,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:10,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 01:54:10,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:10,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:53,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:53,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 01:54:53,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:53,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:54:53,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:54:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:54:53,223 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-10 01:54:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:53,645 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-10 01:54:53,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 01:54:53,649 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-10 01:54:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:53,649 INFO L225 Difference]: With dead ends: 33 [2019-09-10 01:54:53,649 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:54:53,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:54:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:54:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:54:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:54:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-10 01:54:53,653 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-10 01:54:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:53,653 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-10 01:54:53,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:54:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-10 01:54:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:54:53,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:53,654 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:53,654 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-10 01:54:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:53,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:53,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:53,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:54,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:54,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:54,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:54,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:54,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:54,026 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 01:54:54,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:54,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:54,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 01:54:54,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:54,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:55:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:42,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:55:42,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 01:55:42,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:55:42,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 01:55:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 01:55:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 01:55:42,154 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-10 01:55:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:55:42,584 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 01:55:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 01:55:42,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-10 01:55:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:55:42,586 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:55:42,586 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:55:42,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 01:55:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:55:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 01:55:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:55:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 01:55:42,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-10 01:55:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:55:42,591 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 01:55:42,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 01:55:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 01:55:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 01:55:42,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:55:42,592 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:55:42,592 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:55:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:55:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-10 01:55:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:55:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:55:42,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:55:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:55:42,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:55:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:55:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:42,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:42,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:55:42,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:55:42,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:55:42,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:42,997 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 01:55:43,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:55:43,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:55:45,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 01:55:45,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:55:45,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 01:55:45,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:55:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:45,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:56:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:35,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:56:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 01:56:35,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:56:35,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 01:56:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 01:56:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:56:35,058 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-10 01:56:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:35,555 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-10 01:56:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:56:35,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-10 01:56:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:35,556 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:56:35,556 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:56:35,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:56:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:56:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:56:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:56:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-10 01:56:35,560 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-10 01:56:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:35,561 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-10 01:56:35,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 01:56:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-10 01:56:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:56:35,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:35,561 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:35,562 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-10 01:56:35,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:35,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:56:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:35,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:36,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:36,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:36,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:36,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:36,125 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 01:56:36,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:56:36,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:56:36,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:56:36,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:56:36,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 01:56:36,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:56:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:36,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:32,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:32,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 01:57:32,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:32,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 01:57:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 01:57:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 01:57:32,466 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-10 01:57:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:32,966 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-10 01:57:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 01:57:32,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-10 01:57:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:32,967 INFO L225 Difference]: With dead ends: 36 [2019-09-10 01:57:32,967 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:57:32,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 01:57:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:57:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 01:57:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:57:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-10 01:57:32,971 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-10 01:57:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:32,971 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-10 01:57:32,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 01:57:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-10 01:57:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:57:32,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:32,972 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:32,972 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-10 01:57:32,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:32,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:32,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:33,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:33,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:33,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:33,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 01:57:33,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:33,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 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 01:57:33,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:33,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:57:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:33,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 01:57:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:33,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:58:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:58:35,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:58:35,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 01:58:35,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:58:35,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:58:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:58:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:58:35,735 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-10 01:58:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:58:36,295 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-10 01:58:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 01:58:36,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-10 01:58:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:58:36,296 INFO L225 Difference]: With dead ends: 37 [2019-09-10 01:58:36,297 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 01:58:36,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 62.6s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:58:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 01:58:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 01:58:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 01:58:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-10 01:58:36,301 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-10 01:58:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:58:36,302 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-10 01:58:36,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:58:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-10 01:58:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:58:36,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:58:36,303 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:58:36,303 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:58:36,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:58:36,303 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-10 01:58:36,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:58:36,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:36,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:58:36,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:36,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:58:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:58:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:58:36,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:36,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:58:36,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:58:36,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:58:36,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:36,824 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 01:58:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:58:36,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:58:37,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 01:58:37,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:58:37,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-10 01:58:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:58:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:58:37,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:36,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 01:59:36,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:36,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 01:59:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 01:59:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 01:59:36,671 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-10 01:59:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:37,297 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-10 01:59:37,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 01:59:37,298 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-10 01:59:37,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:37,299 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:59:37,299 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:59:37,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 59.7s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 01:59:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:59:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 01:59:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:59:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-10 01:59:37,304 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-10 01:59:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:37,304 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-10 01:59:37,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 01:59:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-10 01:59:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:59:37,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:37,305 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:37,305 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-10 01:59:37,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:37,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:37,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:38,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:38,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:38,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:38,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:38,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:38,037 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) [2019-09-10 01:59:38,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:59:38,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:38,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:59:38,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:59:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 01:59:38,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:38,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:00:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:49,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:00:49,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-10 02:00:49,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:00:49,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:00:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:00:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:00:49,074 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-10 02:00:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:00:49,703 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-10 02:00:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:00:49,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-10 02:00:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:00:49,705 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:00:49,705 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:00:49,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 71.6s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:00:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:00:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 02:00:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:00:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-10 02:00:49,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-10 02:00:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:00:49,709 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-10 02:00:49,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:00:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-10 02:00:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:00:49,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:00:49,710 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:00:49,710 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:00:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:00:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-10 02:00:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:00:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:49,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:00:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:49,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:00:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:50,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:50,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:00:50,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:00:50,276 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:00:50,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:50,276 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:00:50,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:00:50,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:00:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:50,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 02:00:50,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:00:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:50,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:04,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:04,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 02:02:04,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:04,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:02:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:02:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:02:04,470 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-10 02:02:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:05,185 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-10 02:02:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:02:05,186 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-10 02:02:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:05,186 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:02:05,187 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:02:05,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:02:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:02:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-10 02:02:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:02:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-10 02:02:05,190 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-10 02:02:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:05,190 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-10 02:02:05,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:02:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-10 02:02:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:02:05,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:05,191 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:05,192 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-10 02:02:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:05,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:05,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:05,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:05,735 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:02:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:05,735 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:02:05,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:02:05,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:06,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:02:06,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:06,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 02:02:06,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:06,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:24,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-10 02:03:24,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:24,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:03:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:03:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:03:24,655 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-10 02:03:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:25,414 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-10 02:03:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:03:25,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-10 02:03:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:25,415 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:03:25,415 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:03:25,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 78.6s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:03:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:03:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:03:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:03:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-10 02:03:25,419 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-10 02:03:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:25,419 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-10 02:03:25,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:03:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-10 02:03:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:03:25,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:25,420 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:25,420 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-10 02:03:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:25,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:25,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:25,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:25,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:25,996 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:03:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:25,996 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:03:26,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:03:26,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:03:26,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:03:26,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:26,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 02:03:26,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:26,073 INFO L322 TraceCheckSpWp]: Computing backward predicates...