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/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:41:38,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:41:38,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:41:39,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:41:39,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:41:39,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:41:39,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:41:39,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:41:39,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:41:39,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:41:39,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:41:39,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:41:39,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:41:39,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:41:39,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:41:39,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:41:39,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:41:39,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:41:39,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:41:39,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:41:39,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:41:39,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:41:39,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:41:39,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:41:39,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:41:39,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:41:39,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:41:39,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:41:39,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:41:39,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:41:39,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:41:39,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:41:39,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:41:39,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:41:39,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:41:39,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:41:39,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:41:39,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:41:39,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:41:39,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:41:39,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:41:39,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:41:39,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:41:39,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:41:39,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:41:39,097 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:41:39,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:41:39,098 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:41:39,098 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:41:39,098 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:41:39,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:41:39,099 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:41:39,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:41:39,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:41:39,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:41:39,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:41:39,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:41:39,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:41:39,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:41:39,103 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:41:39,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:41:39,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:41:39,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:41:39,104 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:41:39,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:41:39,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:41:39,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:41:39,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:41:39,105 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:41:39,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:41:39,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:41:39,106 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:41:39,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:41:39,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:41:39,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:41:39,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:41:39,199 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:41:39,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-03 20:41:39,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25bb515f/92a0cc32bce8434caee1228f26de40f6/FLAG37ab73ebd [2019-09-03 20:41:39,739 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:41:39,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-03 20:41:39,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25bb515f/92a0cc32bce8434caee1228f26de40f6/FLAG37ab73ebd [2019-09-03 20:41:40,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25bb515f/92a0cc32bce8434caee1228f26de40f6 [2019-09-03 20:41:40,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:41:40,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:41:40,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:41:40,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:41:40,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:41:40,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a0b44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40, skipping insertion in model container [2019-09-03 20:41:40,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:41:40,170 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:41:40,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:41:40,348 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:41:40,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:41:40,379 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:41:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40 WrapperNode [2019-09-03 20:41:40,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:41:40,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:41:40,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:41:40,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:41:40,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... [2019-09-03 20:41:40,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:41:40,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:41:40,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:41:40,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:41:40,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:41:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:41:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:41:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:41:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:41:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:41:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:41:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:41:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:41:40,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:41:40,704 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:41:40,705 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:41:40,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:41:40 BoogieIcfgContainer [2019-09-03 20:41:40,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:41:40,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:41:40,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:41:40,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:41:40,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:41:40" (1/3) ... [2019-09-03 20:41:40,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725d2f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:41:40, skipping insertion in model container [2019-09-03 20:41:40,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:41:40" (2/3) ... [2019-09-03 20:41:40,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725d2f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:41:40, skipping insertion in model container [2019-09-03 20:41:40,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:41:40" (3/3) ... [2019-09-03 20:41:40,714 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2019-09-03 20:41:40,723 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:41:40,732 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:41:40,747 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:41:40,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:41:40,776 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:41:40,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:41:40,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:41:40,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:41:40,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:41:40,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:41:40,777 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:41:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 20:41:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:41:40,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:40,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:40,807 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 20:41:40,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:40,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:40,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:41,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:41:41,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:41:41,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:41:41,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:41:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:41:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:41:41,082 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 20:41:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:41,116 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:41:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:41:41,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:41:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:41,128 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:41:41,129 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:41:41,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:41:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:41:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:41:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:41:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:41:41,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:41:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:41,177 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:41:41,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:41:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:41:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:41:41,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:41,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:41,185 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 20:41:41,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:41,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:41,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:41,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:41,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:41,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:41,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:41,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-03 20:41:41,319 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-03 20:41:41,348 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:41:41,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:41:41,413 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:41:41,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:41:41,682 INFO L272 AbstractInterpreter]: Visited 11 different actions 47 times. Merged at 2 different actions 12 times. Widened at 1 different actions 4 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 12. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:41:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:41,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:41:41,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:41,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:41,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:41,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:41:41,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:41,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:41,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:41,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:41:41,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:41,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:41:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:41:41,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:41:41,865 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 20:41:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:41,896 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-03 20:41:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:41:41,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 20:41:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:41,898 INFO L225 Difference]: With dead ends: 13 [2019-09-03 20:41:41,898 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 20:41:41,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:41:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 20:41:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 20:41:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:41:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 20:41:41,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 20:41:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:41,917 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 20:41:41,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:41:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 20:41:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:41:41,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:41,920 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:41,921 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 20:41:41,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:41,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:42,088 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-03 20:41:42,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:42,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:42,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:42,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,090 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-03 20:41:42,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:42,108 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-03 20:41:42,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:41:42,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:42,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:41:42,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:42,165 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-03 20:41:42,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:42,248 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-03 20:41:42,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:42,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 20:41:42,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:42,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:41:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:41:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:41:42,256 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 20:41:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:42,308 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:41:42,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:41:42,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 20:41:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:42,311 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:41:42,311 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:41:42,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:41:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:41:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:41:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:41:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 20:41:42,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 20:41:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:42,318 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 20:41:42,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:41:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 20:41:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:41:42,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:42,322 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:42,322 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 20:41:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:42,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:42,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:42,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:42,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:42,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:42,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:42,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:42,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:41:42,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:42,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:42,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:42,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:42,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:41:42,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:42,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:41:42,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:42,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:41:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:41:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:41:42,642 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 20:41:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:42,684 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-03 20:41:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:41:42,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 20:41:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:42,686 INFO L225 Difference]: With dead ends: 15 [2019-09-03 20:41:42,686 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 20:41:42,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:41:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 20:41:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 20:41:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:41:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:41:42,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 20:41:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:42,690 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:41:42,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:41:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:41:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:41:42,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:42,691 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:42,691 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:42,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 20:41:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:42,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:42,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:42,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:42,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:42,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:42,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:42,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:42,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:42,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:42,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:41:42,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:42,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:41:43,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:43,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:41:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:41:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:41:43,004 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 20:41:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:43,059 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-03 20:41:43,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:41:43,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 20:41:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:43,060 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:41:43,060 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:41:43,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:41:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:41:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:41:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:41:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:41:43,064 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 20:41:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:43,064 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:41:43,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:41:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:41:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:41:43,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:43,065 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:43,065 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 20:41:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:43,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:43,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:43,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:43,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:43,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:43,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:41:43,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:43,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:43,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:41:43,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:43,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:41:43,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:43,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:41:43,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:43,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:41:43,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:41:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:41:43,508 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 20:41:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:43,578 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-03 20:41:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:41:43,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 20:41:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:43,581 INFO L225 Difference]: With dead ends: 17 [2019-09-03 20:41:43,581 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:41:43,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:41:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:41:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:41:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:41:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:41:43,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 20:41:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:43,590 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:41:43,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:41:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:41:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:41:43,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:43,591 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:43,591 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 20:41:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:43,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:43,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:43,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:43,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:43,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:43,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:43,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:41:43,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:43,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:43,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:43,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:43,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:41:43,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:43,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:44,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 20:41:44,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:44,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:41:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:41:44,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:41:44,035 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 20:41:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:44,098 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:41:44,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:41:44,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 20:41:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:44,099 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:41:44,099 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:41:44,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:41:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:41:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:41:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:41:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 20:41:44,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 20:41:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:44,103 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 20:41:44,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:41:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 20:41:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:41:44,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:44,104 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:44,105 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-03 20:41:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:44,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:44,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:44,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:44,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:44,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:44,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:44,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:41:44,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:44,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:41:44,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:44,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:41:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:41:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:41:44,539 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 20:41:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:44,633 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 20:41:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:41:44,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 20:41:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:44,634 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:41:44,634 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:41:44,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:41:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:41:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:41:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:41:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:41:44,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 20:41:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:44,638 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:41:44,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:41:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:41:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:41:44,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:44,639 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:44,640 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-03 20:41:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:44,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:44,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:44,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:44,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:44,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:44,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:44,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:44,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:44,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:41:44,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:44,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:41:44,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:44,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:45,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:41:45,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:45,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:41:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:41:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:41:45,144 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-03 20:41:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:45,244 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:41:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:41:45,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-03 20:41:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:45,246 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:41:45,246 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:41:45,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:41:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:41:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 20:41:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:41:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 20:41:45,249 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 20:41:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:45,250 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 20:41:45,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:41:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 20:41:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:41:45,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:45,251 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:45,251 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-03 20:41:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:45,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:45,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:45,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:45,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:45,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:45,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:45,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:45,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:41:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:45,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:45,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:45,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:45,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:41:45,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:45,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:41:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:41:45,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:45,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:41:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:41:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:41:45,799 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 20:41:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:45,932 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 20:41:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:41:45,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 20:41:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:45,935 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:41:45,935 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:41:45,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:41:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:41:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 20:41:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:41:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:41:45,939 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 20:41:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:45,939 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:41:45,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:41:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:41:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:41:45,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:45,940 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:45,941 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-03 20:41:45,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:45,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:45,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:46,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:46,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:46,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:46,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:46,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:46,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:46,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:46,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:41:46,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:46,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:46,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 20:41:46,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:46,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:41:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:41:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:41:46,573 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-03 20:41:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:46,724 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:41:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:41:46,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-03 20:41:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:46,726 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:41:46,726 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:41:46,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:41:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:41:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:41:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:41:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 20:41:46,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 20:41:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:46,731 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 20:41:46,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:41:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 20:41:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:41:46,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:46,732 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:46,732 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-03 20:41:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:46,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:46,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:46,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:46,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:46,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:46,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:46,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:46,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:47,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:41:47,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:41:47,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:47,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:47,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:41:47,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:47,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:41:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:41:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:41:47,489 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 20:41:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:47,673 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 20:41:47,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:41:47,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 20:41:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:47,675 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:41:47,675 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:41:47,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:41:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:41:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 20:41:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:41:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:41:47,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 20:41:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:47,680 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:41:47,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:41:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:41:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:41:47,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:47,681 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:47,682 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-03 20:41:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:47,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:47,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:47,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:47,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:47,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:47,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:47,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:47,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:47,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:47,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:47,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:47,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:47,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:41:47,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:48,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:48,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:41:48,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:48,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:41:48,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:41:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:41:48,462 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-03 20:41:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:48,665 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:41:48,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:41:48,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-03 20:41:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:48,666 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:41:48,666 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:41:48,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:41:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:41:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:41:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:41:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 20:41:48,670 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 20:41:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:48,671 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 20:41:48,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:41:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 20:41:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:41:48,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:48,672 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:48,672 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-03 20:41:48,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:48,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:48,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:48,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:48,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:48,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:48,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:48,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:48,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:48,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:48,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:48,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:48,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:41:48,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:48,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:49,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:49,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:41:49,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:49,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:41:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:41:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:41:49,494 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 20:41:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:49,713 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 20:41:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:41:49,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 20:41:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:49,717 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:41:49,718 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:41:49,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:41:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:41:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:41:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:41:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:41:49,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 20:41:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:49,722 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:41:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:41:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:41:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:41:49,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:49,723 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:49,723 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-03 20:41:49,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:49,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:49,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:49,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:49,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:49,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:49,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:49,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:49,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:49,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:25,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:42:25,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:26,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:42:26,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:26,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 20:42:26,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:26,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:42:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:42:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:42:26,659 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-03 20:42:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:26,913 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:42:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:42:26,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 20:42:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:26,917 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:42:26,917 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:42:26,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:42:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:42:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 20:42:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:42:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 20:42:26,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 20:42:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:26,921 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 20:42:26,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:42:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 20:42:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:42:26,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:26,922 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:26,923 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-03 20:42:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:26,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:26,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:27,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:27,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:27,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:27,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:27,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:27,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:27,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:27,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:27,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:27,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:42:27,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:27,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:27,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 20:42:27,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:27,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:42:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:42:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:42:27,947 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 20:42:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:28,237 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 20:42:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:42:28,245 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 20:42:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:28,245 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:42:28,245 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:42:28,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:42:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:42:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:42:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:42:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:42:28,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 20:42:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:28,250 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:42:28,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:42:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:42:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:42:28,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:28,252 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:28,252 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-03 20:42:28,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:28,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:28,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:28,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:28,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:28,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:28,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:28,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:28,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:28,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:28,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:42:28,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:28,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:29,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:29,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-03 20:42:29,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:29,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:42:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:42:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:42:29,398 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-03 20:42:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:29,679 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 20:42:29,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:42:29,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-03 20:42:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:29,681 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:42:29,681 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:42:29,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:42:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:42:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 20:42:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:42:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 20:42:29,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 20:42:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:29,685 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 20:42:29,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:42:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 20:42:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:42:29,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:29,686 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:29,687 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-03 20:42:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:29,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:29,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:30,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:30,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:30,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:30,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:30,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:30,015 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-03 20:42:30,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:30,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:30,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:42:30,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:30,246 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:42:30,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:30,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:31,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-03 20:42:31,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:31,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:42:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:42:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:42:31,327 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 20:42:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:31,682 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 20:42:31,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:42:31,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 20:42:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:31,685 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:42:31,685 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:42:31,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:42:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:42:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 20:42:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:42:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:42:31,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 20:42:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:31,689 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:42:31,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:42:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:42:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:42:31,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:31,690 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:31,691 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-03 20:42:31,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:31,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:31,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:32,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:32,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:32,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:32,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:32,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:32,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:32,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:32,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:32,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:32,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:32,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:42:32,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:32,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 20:42:33,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:33,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:42:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:42:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:42:33,436 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 20:42:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:33,822 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 20:42:33,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:42:33,824 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 20:42:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:33,824 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:42:33,825 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:42:33,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:42:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:42:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 20:42:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:42:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 20:42:33,832 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 20:42:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:33,832 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 20:42:33,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:42:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 20:42:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:42:33,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:33,833 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:33,833 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-03 20:42:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:33,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:33,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:34,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:34,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:34,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:34,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:34,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:34,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:34,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:34,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:34,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:42:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:34,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:35,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 20:42:35,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:35,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:42:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:42:35,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:42:35,215 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 20:42:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:35,615 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 20:42:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:42:35,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 20:42:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:35,617 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:42:35,617 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:42:35,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:42:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:42:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:42:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:42:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 20:42:35,621 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 20:42:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:35,621 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 20:42:35,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:42:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 20:42:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:42:35,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:35,623 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:35,624 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-03 20:42:35,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:35,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:35,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:35,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:35,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:35,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:35,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:35,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:35,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:35,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:35,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:36,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:42:36,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:36,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:42:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:36,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-03 20:42:37,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:37,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:42:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:42:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:42:37,475 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-03 20:42:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:37,890 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:42:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:42:37,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-03 20:42:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:37,892 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:42:37,892 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:42:37,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:42:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:42:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:42:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:42:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 20:42:37,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 20:42:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:37,900 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 20:42:37,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:42:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 20:42:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:42:37,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:37,904 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:37,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-03 20:42:37,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:37,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:37,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:38,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:38,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:38,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:38,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:38,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:38,399 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-03 20:42:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:38,413 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-03 20:42:38,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:38,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:38,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:42:38,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:38,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:39,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:39,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 20:42:39,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:39,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:42:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:42:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:42:39,684 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 20:42:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:40,163 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 20:42:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:42:40,166 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 20:42:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:40,167 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:42:40,167 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:42:40,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:42:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:42:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:42:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:42:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:42:40,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 20:42:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:40,171 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:42:40,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:42:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:42:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:42:40,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:40,172 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:40,172 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-03 20:42:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:40,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:40,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:40,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:40,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:40,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:40,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:40,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:40,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:42:40,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:40,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:43,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:43,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-03 20:42:43,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:43,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:42:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:42:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:42:43,370 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-03 20:42:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:43,864 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 20:42:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:42:43,865 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 20:42:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:43,866 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:42:43,866 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:42:43,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:42:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:42:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 20:42:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:42:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 20:42:43,872 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 20:42:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:43,872 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 20:42:43,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:42:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 20:42:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:42:43,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:43,873 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:43,874 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-03 20:42:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:43,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:44,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:44,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:44,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:44,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:44,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:44,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:51,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:42:51,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:51,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:42:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:51,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:53,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:53,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 20:42:53,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:53,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:42:53,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:42:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:42:53,046 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 20:42:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:53,609 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 20:42:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:42:53,610 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 20:42:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:53,610 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:42:53,610 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:42:53,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:42:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:42:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:42:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:42:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 20:42:53,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 20:42:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:53,614 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 20:42:53,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:42:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 20:42:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:42:53,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:53,615 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:53,615 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-03 20:42:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:53,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:53,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:53,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:54,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:54,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:54,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:54,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:54,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:54,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:54,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:54,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:54,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:54,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:54,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:42:54,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:54,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:55,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 20:42:55,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:55,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:42:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:42:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:42:55,772 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-03 20:42:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:56,352 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 20:42:56,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:42:56,353 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-03 20:42:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:56,353 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:42:56,354 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:42:56,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:42:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:42:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 20:42:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:42:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 20:42:56,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 20:42:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:56,359 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 20:42:56,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:42:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 20:42:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:42:56,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:56,360 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:56,360 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-03 20:42:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:56,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:56,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:56,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:56,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:56,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:56,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:56,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:56,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:57,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:57,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:42:57,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:57,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:58,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:58,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 20:42:58,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:58,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:42:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:42:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:42:58,776 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 20:42:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:59,418 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 20:42:59,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:42:59,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 20:42:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:59,419 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:42:59,419 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:42:59,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:42:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:42:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 20:42:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:42:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 20:42:59,423 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 20:42:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:59,423 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 20:42:59,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:42:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 20:42:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:42:59,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:59,424 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:59,424 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-03 20:42:59,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:59,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:59,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:42:59,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:59,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:59,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:59,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:59,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:59,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:59,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:59,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:44:06,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:44:06,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:44:06,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:44:06,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:06,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 325 refuted. 26 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:23,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 20:47:23,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:23,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:47:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:47:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2225, Unknown=73, NotChecked=0, Total=3192 [2019-09-03 20:47:23,195 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-03 20:47:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:23,879 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 20:47:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:47:23,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 20:47:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:23,880 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:47:23,880 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:47:23,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 196.7s TimeCoverageRelationStatistics Valid=894, Invalid=2225, Unknown=73, NotChecked=0, Total=3192 [2019-09-03 20:47:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:47:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 20:47:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:47:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 20:47:23,884 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 20:47:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:23,885 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 20:47:23,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:47:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 20:47:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:47:23,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:23,886 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:23,886 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:23,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-03 20:47:23,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:23,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:23,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:23,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:23,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:24,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:24,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:24,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:24,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:24,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:24,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:47:24,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:47:24,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:47:24,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:24,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:47:24,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:24,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 20:47:26,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:26,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:47:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:47:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:47:26,510 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 20:47:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:27,211 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 20:47:27,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:47:27,212 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 20:47:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:27,213 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:47:27,213 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:47:27,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:47:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:47:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 20:47:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:47:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 20:47:27,216 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 20:47:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:27,216 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 20:47:27,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:47:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 20:47:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:47:27,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:27,217 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:27,217 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-03 20:47:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:27,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:27,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:27,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:27,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:27,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:27,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:27,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:27,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:27,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:47:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:27,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:47:27,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:27,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:30,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:30,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-03 20:47:30,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:30,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:47:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:47:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:47:30,291 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-03 20:47:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:31,076 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:47:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:47:31,077 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-03 20:47:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:31,078 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:47:31,078 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:47:31,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:47:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:47:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:47:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:47:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 20:47:31,082 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 20:47:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:31,082 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 20:47:31,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:47:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 20:47:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:47:31,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:31,083 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:31,083 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-03 20:47:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:31,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:31,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:31,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:31,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:31,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:31,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:31,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:47:31,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:48:38,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:48:38,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:48:38,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:48:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:48:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:38,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:48:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:48:41,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 20:48:41,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:48:41,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:48:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:48:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:48:41,053 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 20:48:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:48:41,889 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 20:48:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:48:41,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 20:48:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:48:41,891 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:48:41,891 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:48:41,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:48:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:48:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:48:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:48:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 20:48:41,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 20:48:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:48:41,895 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 20:48:41,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:48:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 20:48:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:48:41,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:48:41,896 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:48:41,897 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:48:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:48:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-03 20:48:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:48:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:41,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:48:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:41,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:48:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:48:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:42,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:42,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:48:42,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:48:42,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:48:42,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:42,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:48:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:48:42,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:48:42,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:48:42,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:48:42,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:48:42,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:48:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:42,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:48:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:45,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:48:45,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:48:45,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:48:45,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:48:45,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:48:45,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:48:45,037 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-03 20:48:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:48:45,907 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 20:48:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:48:45,909 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-03 20:48:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:48:45,910 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:48:45,910 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:48:45,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:48:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:48:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 20:48:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:48:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 20:48:45,913 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 20:48:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:48:45,913 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 20:48:45,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:48:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 20:48:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:48:45,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:48:45,914 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:48:45,914 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:48:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:48:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-03 20:48:45,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:48:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:45,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:48:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:45,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:48:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:48:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:46,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:46,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:48:46,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:48:46,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:48:46,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:46,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:48:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:48:47,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:48:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:48:47,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:48:47,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:48:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:47,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:48:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:48:49,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 20:48:49,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:48:49,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:48:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:48:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:48:49,718 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 20:48:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:48:50,656 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 20:48:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:48:50,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 20:48:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:48:50,661 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:48:50,662 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:48:50,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:48:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:48:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:48:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:48:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 20:48:50,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 20:48:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:48:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 20:48:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:48:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 20:48:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:48:50,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:48:50,666 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:48:50,666 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:48:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:48:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-03 20:48:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:48:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:48:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:48:50,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:48:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:48:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:48:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:51,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:48:51,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:48:51,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:48:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:48:51,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:48:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:48:51,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:50:40,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:50:40,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:41,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:50:41,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:41,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 508 refuted. 20 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:33,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:33,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-03 20:55:33,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:33,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:55:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:55:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3298, Unknown=104, NotChecked=0, Total=4692 [2019-09-03 20:55:33,495 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-03 20:55:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:34,488 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 20:55:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:55:34,488 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-03 20:55:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:34,489 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:55:34,489 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:55:34,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 293.0s TimeCoverageRelationStatistics Valid=1290, Invalid=3298, Unknown=104, NotChecked=0, Total=4692 [2019-09-03 20:55:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:55:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:55:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:55:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 20:55:34,494 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 20:55:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:34,494 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 20:55:34,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:55:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 20:55:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:55:34,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:34,495 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:34,495 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-03 20:55:34,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:34,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:34,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:35,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:35,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:35,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:35,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:35,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:35,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:35,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:35,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:55:35,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:35,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:38,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-03 20:55:38,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:38,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:55:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:55:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:55:38,275 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 20:55:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:39,318 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 20:55:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:55:39,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 20:55:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:39,319 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:55:39,319 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:55:39,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:55:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:55:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 20:55:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:55:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 20:55:39,322 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 20:55:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:39,323 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 20:55:39,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:55:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 20:55:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:55:39,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:39,323 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:39,324 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-03 20:55:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:39,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:39,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:40,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:40,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:40,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:40,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:40,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:40,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:40,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:40,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:40,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:55:40,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:40,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:44,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:44,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-03 20:55:44,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:44,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:55:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:55:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:55:44,776 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-03 20:55:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:45,877 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 20:55:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:55:45,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-03 20:55:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:45,878 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:55:45,878 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:55:45,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:55:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:55:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 20:55:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:55:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 20:55:45,881 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 20:55:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:45,882 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 20:55:45,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:55:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 20:55:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:55:45,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:45,883 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:45,883 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-03 20:55:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:45,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:46,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:46,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:46,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:46,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:46,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:46,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)