java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:17:21,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:17:21,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:17:21,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:17:21,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:17:21,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:17:21,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:17:21,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:17:21,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:17:21,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:17:21,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:17:21,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:17:21,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:17:21,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:17:21,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:17:21,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:17:21,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:17:21,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:17:21,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:17:21,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:17:21,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:17:21,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:17:21,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:17:21,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:17:21,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:17:21,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:17:21,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:17:21,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:17:21,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:17:21,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:17:21,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:17:21,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:17:21,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:17:21,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:17:21,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:17:21,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:17:21,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:17:21,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:17:21,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:17:21,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:17:21,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:17:21,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:17:21,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:17:21,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:17:21,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:17:21,380 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:17:21,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:17:21,381 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:17:21,382 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:17:21,382 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:17:21,382 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:17:21,382 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:17:21,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:17:21,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:17:21,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:17:21,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:17:21,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:17:21,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:17:21,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:17:21,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:17:21,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:17:21,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:17:21,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:17:21,387 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:17:21,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:17:21,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:17:21,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:17:21,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:17:21,389 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:17:21,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:17:21,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:17:21,389 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:17:21,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:17:21,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:17:21,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:17:21,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:17:21,471 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:17:21,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-10 02:17:21,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b471c04/d17b1cf8c12a407583975085c14e35b3/FLAG58fcc823f [2019-09-10 02:17:21,991 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:17:21,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-10 02:17:21,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b471c04/d17b1cf8c12a407583975085c14e35b3/FLAG58fcc823f [2019-09-10 02:17:22,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b471c04/d17b1cf8c12a407583975085c14e35b3 [2019-09-10 02:17:22,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:17:22,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:17:22,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:22,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:17:22,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:17:22,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76db5ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22, skipping insertion in model container [2019-09-10 02:17:22,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,414 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:17:22,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:17:22,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:22,618 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:17:22,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:22,644 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:17:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22 WrapperNode [2019-09-10 02:17:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:22,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:17:22,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:17:22,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:17:22,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... [2019-09-10 02:17:22,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:17:22,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:17:22,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:17:22,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:17:22,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:17:22,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:17:22,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:17:22,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:17:22,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:17:22,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:17:22,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:17:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:17:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:17:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:17:23,013 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:17:23,013 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-10 02:17:23,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:23 BoogieIcfgContainer [2019-09-10 02:17:23,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:17:23,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:17:23,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:17:23,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:17:23,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:17:22" (1/3) ... [2019-09-10 02:17:23,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b36e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:23, skipping insertion in model container [2019-09-10 02:17:23,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:22" (2/3) ... [2019-09-10 02:17:23,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b36e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:23, skipping insertion in model container [2019-09-10 02:17:23,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:23" (3/3) ... [2019-09-10 02:17:23,022 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2019-09-10 02:17:23,032 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:17:23,040 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:17:23,055 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:17:23,080 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:17:23,080 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:17:23,080 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:17:23,080 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:17:23,080 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:17:23,080 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:17:23,081 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:17:23,081 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:17:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-10 02:17:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:17:23,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:23,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:23,106 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-10 02:17:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:23,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:23,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:17:23,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:23,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:17:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:17:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:17:23,221 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-10 02:17:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:23,236 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:17:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:17:23,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:17:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:23,244 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:17:23,244 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:17:23,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:17:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:17:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 02:17:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 02:17:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-10 02:17:23,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-10 02:17:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:23,285 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-10 02:17:23,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:17:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-10 02:17:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:17:23,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:23,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:23,287 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:23,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-10 02:17:23,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:23,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:23,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:23,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:23,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:23,427 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-10 02:17:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:23,466 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-09-10 02:17:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:23,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:17:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:23,468 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:17:23,469 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:17:23,470 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-10 02:17:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:17:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-10 02:17:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 02:17:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-10 02:17:23,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-10 02:17:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:23,484 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-10 02:17:23,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-10 02:17:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:17:23,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:23,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:23,488 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-10 02:17:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:23,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:23,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:23,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:23,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:23,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:23,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:23,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:23,591 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-10 02:17:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:23,623 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-09-10 02:17:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:23,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-10 02:17:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:23,625 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:17:23,626 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:17:23,626 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-10 02:17:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:17:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-10 02:17:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:17:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:17:23,631 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-10 02:17:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:23,632 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:17:23,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:17:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:17:23,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:23,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:23,634 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-10 02:17:23,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:23,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:23,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:23,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:23,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:23,717 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-10 02:17:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:23,728 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:17:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:23,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-10 02:17:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:23,730 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:17:23,730 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:17:23,731 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-10 02:17:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:17:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-10 02:17:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:17:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-10 02:17:23,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-10 02:17:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:23,736 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-10 02:17:23,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-10 02:17:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:17:23,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:23,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:23,738 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-10 02:17:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:23,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:23,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:23,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:23,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 02:17:23,863 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [22], [29], [31], [47], [50], [52], [58], [59], [60], [62] [2019-09-10 02:17:23,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:17:23,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:17:23,992 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:17:24,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:17:24,285 INFO L272 AbstractInterpreter]: Visited 13 different actions 55 times. Merged at 2 different actions 14 times. Widened at 1 different actions 5 times. Performed 92 root evaluator evaluations with a maximum evaluation depth of 12. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 02:17:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:24,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:17:24,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:24,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:24,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:24,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:24,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:17:24,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:24,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 02:17:24,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:24,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:17:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:17:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:17:24,430 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-10 02:17:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:24,474 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-10 02:17:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:17:24,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:17:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:24,478 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:17:24,479 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:17:24,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 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-10 02:17:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:17:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-10 02:17:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:17:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 02:17:24,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-10 02:17:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:24,489 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 02:17:24,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:17:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 02:17:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:17:24,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:24,491 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:24,492 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-10 02:17:24,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:24,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:24,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:24,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:24,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:24,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:24,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:24,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:24,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:24,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:17:24,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:24,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:17:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:24,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 02:17:24,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:24,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:17:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:17:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:17:24,752 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-10 02:17:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:24,802 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-10 02:17:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:17:24,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-10 02:17:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:24,804 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:17:24,804 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:17:24,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 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-10 02:17:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:17:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-10 02:17:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:17:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-10 02:17:24,808 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-10 02:17:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:24,809 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-10 02:17:24,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:17:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-10 02:17:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:17:24,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:24,810 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:24,810 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-10 02:17:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:24,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:24,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:24,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:24,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:24,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:24,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:24,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:24,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:24,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:24,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:17:24,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:24,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:25,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 02:17:25,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:25,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:17:25,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:17:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:17:25,094 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-10 02:17:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,151 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 02:17:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:17:25,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-10 02:17:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,153 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:17:25,153 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:17:25,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 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-10 02:17:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:17:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-10 02:17:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:17:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-10 02:17:25,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-10 02:17:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,158 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-10 02:17:25,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:17:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-10 02:17:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:17:25,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,160 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,160 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-10 02:17:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:25,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:25,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:25,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:25,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:25,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:17:25,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:25,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 02:17:25,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:25,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:17:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:17:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:25,455 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-10 02:17:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:25,514 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-10 02:17:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:17:25,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-10 02:17:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:25,515 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:17:25,515 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:17:25,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 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-10 02:17:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:17:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-10 02:17:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 02:17:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 02:17:25,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-10 02:17:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:25,523 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 02:17:25,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:17:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 02:17:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:17:25,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:25,524 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:25,524 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-10 02:17:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:25,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:25,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:25,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:25,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:25,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:25,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:25,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:25,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:25,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:25,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:25,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:17:25,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:25,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:17:25,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:25,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:25,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:25,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:25,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:25,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:17:31,073 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-10 02:17:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 02:17:35,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 02:17:48,381 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:17:48,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 16 [2019-09-10 02:17:48,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:48,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:17:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:17:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=181, Unknown=6, NotChecked=0, Total=240 [2019-09-10 02:17:48,383 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-09-10 02:17:52,478 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~z~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~z~0_BEFORE_CALL_1 4294967296)) (.cse1 (mod v_main_~z~0_BEFORE_CALL_1 4))) (and (<= 0 .cse0) (= .cse1 c___VERIFIER_assert_~cond) (< (mod (+ v_main_~z~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= 268435455 .cse0) (<= .cse1 2147483647)))) (exists ((v_main_~z~0_BEFORE_CALL_1 Int)) (let ((.cse2 (mod v_main_~z~0_BEFORE_CALL_1 4294967296)) (.cse3 (mod v_main_~z~0_BEFORE_CALL_1 4))) (and (<= 0 .cse2) (< (mod (+ v_main_~z~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= 268435455 .cse2) (= |c___VERIFIER_assert_#in~cond| .cse3) (<= .cse3 2147483647))))) is different from true [2019-09-10 02:17:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:53,407 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-10 02:17:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:17:53,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-10 02:17:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:53,409 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:17:53,409 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:17:53,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=55, Invalid=182, Unknown=7, NotChecked=28, Total=272 [2019-09-10 02:17:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:17:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-10 02:17:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:17:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 02:17:53,413 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2019-09-10 02:17:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:53,413 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 02:17:53,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:17:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 02:17:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:17:53,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:53,415 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:53,415 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1080485078, now seen corresponding path program 1 times [2019-09-10 02:17:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:53,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:53,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:53,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:53,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:53,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-10 02:17:53,505 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [20], [22], [29], [31], [36], [47], [50], [52], [55], [57], [58], [59], [60], [62], [63], [64] [2019-09-10 02:17:53,509 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:17:53,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:17:53,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:17:54,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:17:54,382 INFO L272 AbstractInterpreter]: Visited 19 different actions 206 times. Merged at 6 different actions 51 times. Widened at 3 different actions 16 times. Performed 310 root evaluator evaluations with a maximum evaluation depth of 12. Performed 310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 13 fixpoints after 3 different actions. Largest state had 6 variables. [2019-09-10 02:17:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:54,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:17:54,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:54,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:54,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:54,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:54,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:17:54,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:17:54,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:17:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:54,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2019-09-10 02:17:54,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:54,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:17:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:17:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:17:54,581 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2019-09-10 02:17:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:54,874 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-09-10 02:17:54,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:17:54,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-09-10 02:17:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:54,877 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:17:54,877 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:17:54,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:17:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:17:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-09-10 02:17:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:17:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-09-10 02:17:54,884 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2019-09-10 02:17:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:54,884 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-09-10 02:17:54,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:17:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-09-10 02:17:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:17:54,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:54,886 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:54,886 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash 646358326, now seen corresponding path program 2 times [2019-09-10 02:17:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:54,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:17:55,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:55,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:55,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:55,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:55,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:55,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:55,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:55,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:17:55,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:55,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:17:55,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 02:17:55,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 02:17:55,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:55,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2019-09-10 02:17:55,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:55,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:17:55,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:17:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:17:55,366 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 15 states. [2019-09-10 02:17:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:55,933 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-09-10 02:17:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:17:55,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-09-10 02:17:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:55,935 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:17:55,936 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 02:17:55,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:17:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 02:17:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-09-10 02:17:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:17:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-09-10 02:17:55,956 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 39 [2019-09-10 02:17:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:55,956 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-09-10 02:17:55,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:17:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-09-10 02:17:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:17:55,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:55,958 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:55,958 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1860941642, now seen corresponding path program 3 times [2019-09-10 02:17:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:55,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:55,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 137 proven. 28 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-10 02:17:56,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:56,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:56,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:56,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:56,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:56,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:56,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:56,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:56,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:56,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:17:56,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 02:17:56,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 22 proven. 210 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 02:17:56,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:56,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2019-09-10 02:17:56,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:56,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:17:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:17:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:17:56,479 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 18 states. [2019-09-10 02:17:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:57,380 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-09-10 02:17:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:17:57,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-09-10 02:17:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:57,381 INFO L225 Difference]: With dead ends: 79 [2019-09-10 02:17:57,381 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 02:17:57,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=2338, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:17:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 02:17:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2019-09-10 02:17:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:17:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-10 02:17:57,389 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 56 [2019-09-10 02:17:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:57,389 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-10 02:17:57,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:17:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-10 02:17:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 02:17:57,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:57,392 INFO L399 BasicCegarLoop]: trace histogram [32, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:57,392 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash -330095560, now seen corresponding path program 4 times [2019-09-10 02:17:57,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:57,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:57,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 255 proven. 36 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-10 02:17:57,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:57,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:57,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:57,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:57,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:57,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:57,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:57,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:17:57,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 8 proven. 538 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-10 02:17:57,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 28 proven. 518 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-10 02:17:58,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:58,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 02:17:58,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:58,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:17:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:17:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:17:58,119 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 21 states. [2019-09-10 02:17:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:59,446 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-09-10 02:17:59,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 02:17:59,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2019-09-10 02:17:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:59,449 INFO L225 Difference]: With dead ends: 97 [2019-09-10 02:17:59,449 INFO L226 Difference]: Without dead ends: 97 [2019-09-10 02:17:59,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=822, Invalid=4148, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:17:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-10 02:17:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2019-09-10 02:17:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-10 02:17:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-09-10 02:17:59,458 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 75 [2019-09-10 02:17:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:59,459 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-09-10 02:17:59,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:17:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-09-10 02:17:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:17:59,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:59,461 INFO L399 BasicCegarLoop]: trace histogram [45, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:59,461 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash -300648342, now seen corresponding path program 5 times [2019-09-10 02:17:59,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:59,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 415 proven. 45 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-09-10 02:17:59,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:59,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:59,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:59,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:59,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:59,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:59,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:00,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:18:00,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:00,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:18:00,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 437 proven. 45 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2019-09-10 02:18:00,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 423 proven. 45 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2019-09-10 02:18:00,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 02:18:00,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:00,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:18:00,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:18:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:18:00,935 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 13 states. [2019-09-10 02:18:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:01,038 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-09-10 02:18:01,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:18:01,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-10 02:18:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:01,039 INFO L225 Difference]: With dead ends: 90 [2019-09-10 02:18:01,039 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 02:18:01,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 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-10 02:18:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 02:18:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-10 02:18:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-10 02:18:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-09-10 02:18:01,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 96 [2019-09-10 02:18:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:01,049 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-09-10 02:18:01,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:18:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-09-10 02:18:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:18:01,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:01,051 INFO L399 BasicCegarLoop]: trace histogram [50, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:01,051 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash 618162905, now seen corresponding path program 6 times [2019-09-10 02:18:01,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:01,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:01,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:01,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 499 proven. 55 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2019-09-10 02:18:01,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:01,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:01,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:01,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:01,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:01,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:18:01,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:01,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:01,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:01,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:01,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:18:01,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 10 proven. 1290 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-10 02:18:01,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 40 proven. 1260 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-10 02:18:02,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:02,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2019-09-10 02:18:02,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:02,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:18:02,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:18:02,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:18:02,006 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 25 states. [2019-09-10 02:18:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:04,036 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-09-10 02:18:04,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-10 02:18:04,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2019-09-10 02:18:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:04,037 INFO L225 Difference]: With dead ends: 124 [2019-09-10 02:18:04,038 INFO L226 Difference]: Without dead ends: 124 [2019-09-10 02:18:04,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1323, Invalid=7989, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 02:18:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-10 02:18:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2019-09-10 02:18:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-10 02:18:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2019-09-10 02:18:04,047 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 101 [2019-09-10 02:18:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:04,048 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2019-09-10 02:18:04,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:18:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2019-09-10 02:18:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 02:18:04,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:04,054 INFO L399 BasicCegarLoop]: trace histogram [66, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:04,055 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1206904052, now seen corresponding path program 7 times [2019-09-10 02:18:04,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 738 proven. 66 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2019-09-10 02:18:04,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:04,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:04,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:04,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,308 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) [2019-09-10 02:18:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:04,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:04,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:18:04,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 12 proven. 2267 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:18:04,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 47 proven. 2232 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:18:05,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:05,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2019-09-10 02:18:05,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:05,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:18:05,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:18:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:18:05,595 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 28 states. [2019-09-10 02:18:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:08,885 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2019-09-10 02:18:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-10 02:18:08,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 125 [2019-09-10 02:18:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:08,887 INFO L225 Difference]: With dead ends: 147 [2019-09-10 02:18:08,888 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 02:18:08,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3759 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1849, Invalid=12193, Unknown=0, NotChecked=0, Total=14042 [2019-09-10 02:18:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 02:18:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2019-09-10 02:18:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-10 02:18:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-09-10 02:18:08,910 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 125 [2019-09-10 02:18:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:08,910 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-09-10 02:18:08,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:18:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-09-10 02:18:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:18:08,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:08,916 INFO L399 BasicCegarLoop]: trace histogram [84, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:08,917 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:08,918 INFO L82 PathProgramCache]: Analyzing trace with hash 337948795, now seen corresponding path program 8 times [2019-09-10 02:18:08,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:08,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:08,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1035 proven. 78 refuted. 0 times theorem prover too weak. 3150 trivial. 0 not checked. [2019-09-10 02:18:09,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:09,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:09,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:09,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:09,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:09,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:09,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:09,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:34,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:18:34,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:34,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:18:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1069 proven. 78 refuted. 0 times theorem prover too weak. 3116 trivial. 0 not checked. [2019-09-10 02:18:35,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1047 proven. 78 refuted. 0 times theorem prover too weak. 3138 trivial. 0 not checked. [2019-09-10 02:18:35,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:35,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 02:18:35,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:35,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:18:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:18:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:18:35,753 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 16 states. [2019-09-10 02:18:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:35,932 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2019-09-10 02:18:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:18:35,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2019-09-10 02:18:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:35,934 INFO L225 Difference]: With dead ends: 139 [2019-09-10 02:18:35,934 INFO L226 Difference]: Without dead ends: 139 [2019-09-10 02:18:35,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:18:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-10 02:18:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-10 02:18:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-10 02:18:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2019-09-10 02:18:35,940 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 151 [2019-09-10 02:18:35,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:35,940 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2019-09-10 02:18:35,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:18:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2019-09-10 02:18:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:18:35,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:35,942 INFO L399 BasicCegarLoop]: trace histogram [91, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:35,942 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -453638294, now seen corresponding path program 9 times [2019-09-10 02:18:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:35,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:35,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 1197 proven. 91 refuted. 0 times theorem prover too weak. 3633 trivial. 0 not checked. [2019-09-10 02:18:36,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:36,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:36,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:36,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:36,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:36,206 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) [2019-09-10 02:18:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:36,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:36,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:36,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:36,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:18:36,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 14 proven. 4262 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-09-10 02:18:36,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 62 proven. 4214 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-09-10 02:18:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2019-09-10 02:18:37,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:37,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:18:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:18:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1862, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:18:37,595 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 32 states. [2019-09-10 02:18:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:42,344 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2019-09-10 02:18:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-10 02:18:42,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 158 [2019-09-10 02:18:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:42,346 INFO L225 Difference]: With dead ends: 181 [2019-09-10 02:18:42,346 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 02:18:42,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6568 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2674, Invalid=20278, Unknown=0, NotChecked=0, Total=22952 [2019-09-10 02:18:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 02:18:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-09-10 02:18:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-10 02:18:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2019-09-10 02:18:42,358 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 158 [2019-09-10 02:18:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:42,359 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2019-09-10 02:18:42,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:18:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2019-09-10 02:18:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 02:18:42,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:42,361 INFO L399 BasicCegarLoop]: trace histogram [112, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:42,361 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 587682364, now seen corresponding path program 10 times [2019-09-10 02:18:42,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:42,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:42,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:42,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 1599 proven. 105 refuted. 0 times theorem prover too weak. 5656 trivial. 0 not checked. [2019-09-10 02:18:42,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:42,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:42,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:42,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:42,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:42,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:42,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:42,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:42,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:18:42,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 16 proven. 6482 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-09-10 02:18:43,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 70 proven. 6428 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-09-10 02:18:44,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:44,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 20] total 53 [2019-09-10 02:18:44,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:44,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:18:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:18:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2279, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:18:44,147 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand 35 states. [2019-09-10 02:18:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:49,232 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2019-09-10 02:18:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-10 02:18:49,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 187 [2019-09-10 02:18:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:49,234 INFO L225 Difference]: With dead ends: 209 [2019-09-10 02:18:49,234 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 02:18:49,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9486 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3492, Invalid=28370, Unknown=0, NotChecked=0, Total=31862 [2019-09-10 02:18:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 02:18:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2019-09-10 02:18:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:18:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2019-09-10 02:18:49,242 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 187 [2019-09-10 02:18:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:49,243 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2019-09-10 02:18:49,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:18:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2019-09-10 02:18:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:18:49,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:49,246 INFO L399 BasicCegarLoop]: trace histogram [135, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:49,246 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1970933494, now seen corresponding path program 11 times [2019-09-10 02:18:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:49,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 2075 proven. 120 refuted. 0 times theorem prover too weak. 8380 trivial. 0 not checked. [2019-09-10 02:18:49,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:49,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:49,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:49,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:49,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:49,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:49,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:20:08,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:20:08,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:08,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:20:08,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 2121 proven. 120 refuted. 0 times theorem prover too weak. 8334 trivial. 0 not checked. [2019-09-10 02:20:08,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 2091 proven. 120 refuted. 0 times theorem prover too weak. 8364 trivial. 0 not checked. [2019-09-10 02:20:09,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:09,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 02:20:09,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:09,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:20:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:20:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:20:09,196 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 19 states. [2019-09-10 02:20:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:09,465 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2019-09-10 02:20:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:20:09,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 218 [2019-09-10 02:20:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:09,467 INFO L225 Difference]: With dead ends: 200 [2019-09-10 02:20:09,467 INFO L226 Difference]: Without dead ends: 200 [2019-09-10 02:20:09,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:20:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-10 02:20:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-10 02:20:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 02:20:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2019-09-10 02:20:09,476 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 218 [2019-09-10 02:20:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:09,476 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2019-09-10 02:20:09,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:20:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2019-09-10 02:20:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:20:09,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:09,479 INFO L399 BasicCegarLoop]: trace histogram [144, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:09,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -613373251, now seen corresponding path program 12 times [2019-09-10 02:20:09,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:09,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:09,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:09,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:09,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 2339 proven. 136 refuted. 0 times theorem prover too weak. 9432 trivial. 0 not checked. [2019-09-10 02:20:09,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:09,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:09,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:09,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:09,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:09,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:20:09,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:20:09,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:20:09,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:09,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:20:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 18 proven. 10636 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-09-10 02:20:10,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 88 proven. 10566 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-09-10 02:20:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 59 [2019-09-10 02:20:11,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:11,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:20:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:20:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=2851, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:20:11,590 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 39 states. [2019-09-10 02:20:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:19,392 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2019-09-10 02:20:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2019-09-10 02:20:19,393 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 227 [2019-09-10 02:20:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:19,394 INFO L225 Difference]: With dead ends: 250 [2019-09-10 02:20:19,394 INFO L226 Difference]: Without dead ends: 250 [2019-09-10 02:20:19,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14905 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4721, Invalid=43021, Unknown=0, NotChecked=0, Total=47742 [2019-09-10 02:20:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-10 02:20:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229. [2019-09-10 02:20:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-10 02:20:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2019-09-10 02:20:19,405 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 227 [2019-09-10 02:20:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:19,405 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2019-09-10 02:20:19,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:20:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2019-09-10 02:20:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 02:20:19,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:19,407 INFO L399 BasicCegarLoop]: trace histogram [170, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:19,407 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash -970228748, now seen corresponding path program 13 times [2019-09-10 02:20:19,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:19,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:19,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 2946 proven. 153 refuted. 0 times theorem prover too weak. 13356 trivial. 0 not checked. [2019-09-10 02:20:19,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:19,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:19,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:19,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:19,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:19,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:19,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:19,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:19,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:20:19,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 20 proven. 14857 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2019-09-10 02:20:20,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 97 proven. 14780 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2019-09-10 02:20:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 64 [2019-09-10 02:20:21,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:21,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:20:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:20:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=3362, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:20:21,890 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand 42 states. [2019-09-10 02:20:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:30,374 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2019-09-10 02:20:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2019-09-10 02:20:30,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 261 [2019-09-10 02:20:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:30,380 INFO L225 Difference]: With dead ends: 283 [2019-09-10 02:20:30,380 INFO L226 Difference]: Without dead ends: 283 [2019-09-10 02:20:30,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20152 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5895, Invalid=56855, Unknown=0, NotChecked=0, Total=62750 [2019-09-10 02:20:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-10 02:20:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 261. [2019-09-10 02:20:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 02:20:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 285 transitions. [2019-09-10 02:20:30,394 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 285 transitions. Word has length 261 [2019-09-10 02:20:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:30,397 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 285 transitions. [2019-09-10 02:20:30,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:20:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 285 transitions. [2019-09-10 02:20:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-10 02:20:30,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:30,401 INFO L399 BasicCegarLoop]: trace histogram [198, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:30,402 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1582663135, now seen corresponding path program 14 times [2019-09-10 02:20:30,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:30,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3643 proven. 171 refuted. 0 times theorem prover too weak. 18340 trivial. 0 not checked. [2019-09-10 02:20:30,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:30,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:30,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:30,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:30,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:30,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:20:30,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:23:37,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:23:37,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:37,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:23:37,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3701 proven. 171 refuted. 0 times theorem prover too weak. 18282 trivial. 0 not checked. [2019-09-10 02:23:37,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3663 proven. 171 refuted. 0 times theorem prover too weak. 18320 trivial. 0 not checked. [2019-09-10 02:24:22,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:24:22,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 02:24:22,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:24:22,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:24:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:24:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1149, Unknown=13, NotChecked=0, Total=1640 [2019-09-10 02:24:22,819 INFO L87 Difference]: Start difference. First operand 261 states and 285 transitions. Second operand 22 states. [2019-09-10 02:24:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:24:23,173 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2019-09-10 02:24:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:24:23,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 297 [2019-09-10 02:24:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:24:23,176 INFO L225 Difference]: With dead ends: 273 [2019-09-10 02:24:23,177 INFO L226 Difference]: Without dead ends: 273 [2019-09-10 02:24:23,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 574 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=478, Invalid=1149, Unknown=13, NotChecked=0, Total=1640 [2019-09-10 02:24:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-10 02:24:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2019-09-10 02:24:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-10 02:24:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 296 transitions. [2019-09-10 02:24:23,184 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 296 transitions. Word has length 297 [2019-09-10 02:24:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:24:23,184 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 296 transitions. [2019-09-10 02:24:23,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:24:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 296 transitions. [2019-09-10 02:24:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 02:24:23,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:24:23,186 INFO L399 BasicCegarLoop]: trace histogram [209, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:24:23,187 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:24:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:24:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1799634314, now seen corresponding path program 15 times [2019-09-10 02:24:23,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:24:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:23,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:24:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:23,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:24:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 4033 proven. 190 refuted. 0 times theorem prover too weak. 20285 trivial. 0 not checked. [2019-09-10 02:24:23,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:23,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:24:23,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:24:23,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:24:23,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:23,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:24:23,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:24:23,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:24:23,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:24:23,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:24:23,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:24:23,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:24:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 22 proven. 22338 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2019-09-10 02:24:24,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 118 proven. 22242 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2019-09-10 02:24:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:24:26,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 26] total 70 [2019-09-10 02:24:26,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:24:26,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:24:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:24:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=4050, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:24:26,416 INFO L87 Difference]: Start difference. First operand 272 states and 296 transitions. Second operand 46 states. [2019-09-10 02:24:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:24:37,966 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2019-09-10 02:24:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2019-09-10 02:24:37,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 308 [2019-09-10 02:24:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:24:37,970 INFO L225 Difference]: With dead ends: 331 [2019-09-10 02:24:37,970 INFO L226 Difference]: Without dead ends: 331 [2019-09-10 02:24:37,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29448 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7608, Invalid=80898, Unknown=0, NotChecked=0, Total=88506 [2019-09-10 02:24:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-10 02:24:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 307. [2019-09-10 02:24:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-10 02:24:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 333 transitions. [2019-09-10 02:24:37,983 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 333 transitions. Word has length 308 [2019-09-10 02:24:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:24:37,984 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 333 transitions. [2019-09-10 02:24:37,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:24:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 333 transitions. [2019-09-10 02:24:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-10 02:24:37,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:24:37,986 INFO L399 BasicCegarLoop]: trace histogram [240, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:24:37,987 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:24:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:24:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1626008000, now seen corresponding path program 16 times [2019-09-10 02:24:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:24:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:37,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:24:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:37,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:24:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 4887 proven. 210 refuted. 0 times theorem prover too weak. 27027 trivial. 0 not checked. [2019-09-10 02:24:38,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:38,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:24:38,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:24:38,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:24:38,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:38,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:24:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:24:38,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:24:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:38,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 02:24:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:24:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 24 proven. 29498 refuted. 0 times theorem prover too weak. 2602 trivial. 0 not checked. [2019-09-10 02:24:39,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 128 proven. 29394 refuted. 0 times theorem prover too weak. 2602 trivial. 0 not checked. [2019-09-10 02:24:41,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:24:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28, 28] total 75 [2019-09-10 02:24:41,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:24:41,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:24:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:24:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=4655, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:24:41,761 INFO L87 Difference]: Start difference. First operand 307 states and 333 transitions. Second operand 49 states. [2019-09-10 02:24:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:24:55,820 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-09-10 02:24:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2019-09-10 02:24:55,820 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 347 [2019-09-10 02:24:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:24:55,823 INFO L225 Difference]: With dead ends: 369 [2019-09-10 02:24:55,823 INFO L226 Difference]: Without dead ends: 369 [2019-09-10 02:24:55,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38025 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=9202, Invalid=102688, Unknown=0, NotChecked=0, Total=111890 [2019-09-10 02:24:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-10 02:24:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 344. [2019-09-10 02:24:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-10 02:24:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 372 transitions. [2019-09-10 02:24:55,837 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 372 transitions. Word has length 347 [2019-09-10 02:24:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:24:55,837 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 372 transitions. [2019-09-10 02:24:55,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:24:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 372 transitions. [2019-09-10 02:24:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-10 02:24:55,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:24:55,840 INFO L399 BasicCegarLoop]: trace histogram [273, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:24:55,840 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:24:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:24:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash -882376790, now seen corresponding path program 17 times [2019-09-10 02:24:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:24:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:24:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:24:55,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:24:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:24:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5847 proven. 231 refuted. 0 times theorem prover too weak. 35262 trivial. 0 not checked. [2019-09-10 02:24:56,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:56,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:24:56,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:24:56,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:24:56,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:24:56,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:24:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:24:56,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:28:35,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:28:35,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:28:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-10 02:28:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5455 proven. 5985 refuted. 0 times theorem prover too weak. 29900 trivial. 0 not checked. [2019-09-10 02:28:35,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:30:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5871 proven. 222 refuted. 9 times theorem prover too weak. 35238 trivial. 0 not checked. [2019-09-10 02:30:41,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:30:41,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 02:30:41,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:30:41,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:30:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:30:41,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1497, Unknown=46, NotChecked=0, Total=2162 [2019-09-10 02:30:41,860 INFO L87 Difference]: Start difference. First operand 344 states and 372 transitions. Second operand 25 states. [2019-09-10 02:30:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:42,300 INFO L93 Difference]: Finished difference Result 358 states and 386 transitions. [2019-09-10 02:30:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:30:42,301 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 388 [2019-09-10 02:30:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:42,303 INFO L225 Difference]: With dead ends: 358 [2019-09-10 02:30:42,303 INFO L226 Difference]: Without dead ends: 358 [2019-09-10 02:30:42,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 752 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 126.3s TimeCoverageRelationStatistics Valid=619, Invalid=1497, Unknown=46, NotChecked=0, Total=2162 [2019-09-10 02:30:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-10 02:30:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-09-10 02:30:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-10 02:30:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 385 transitions. [2019-09-10 02:30:42,313 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 385 transitions. Word has length 388 [2019-09-10 02:30:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:42,314 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 385 transitions. [2019-09-10 02:30:42,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:30:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 385 transitions. [2019-09-10 02:30:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-10 02:30:42,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:42,317 INFO L399 BasicCegarLoop]: trace histogram [286, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:42,317 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -704827743, now seen corresponding path program 18 times [2019-09-10 02:30:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:42,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:30:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:42,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 6387 proven. 253 refuted. 0 times theorem prover too weak. 38496 trivial. 0 not checked. [2019-09-10 02:30:43,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:43,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:30:43,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:30:43,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:30:43,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:43,176 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) [2019-09-10 02:30:43,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:30:43,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:30:43,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:30:43,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:30:43,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-10 02:30:43,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:30:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 26 proven. 41726 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2019-09-10 02:30:44,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:30:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 152 proven. 41600 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2019-09-10 02:30:47,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:30:47,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30, 30] total 81 [2019-09-10 02:30:47,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:30:47,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:30:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:30:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=5459, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:30:47,232 INFO L87 Difference]: Start difference. First operand 357 states and 385 transitions. Second operand 53 states. [2019-09-10 02:31:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:05,982 INFO L93 Difference]: Finished difference Result 424 states and 456 transitions. [2019-09-10 02:31:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 361 states. [2019-09-10 02:31:05,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 401 [2019-09-10 02:31:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:05,986 INFO L225 Difference]: With dead ends: 424 [2019-09-10 02:31:05,989 INFO L226 Difference]: Without dead ends: 424 [2019-09-10 02:31:06,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52717 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=11479, Invalid=139453, Unknown=0, NotChecked=0, Total=150932 [2019-09-10 02:31:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-10 02:31:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 397. [2019-09-10 02:31:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 02:31:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 427 transitions. [2019-09-10 02:31:06,009 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 427 transitions. Word has length 401 [2019-09-10 02:31:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:06,009 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 427 transitions. [2019-09-10 02:31:06,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:31:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 427 transitions. [2019-09-10 02:31:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-10 02:31:06,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:06,012 INFO L399 BasicCegarLoop]: trace histogram [322, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:06,013 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1284109556, now seen corresponding path program 19 times [2019-09-10 02:31:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:06,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:31:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:06,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 7530 proven. 276 refuted. 0 times theorem prover too weak. 49153 trivial. 0 not checked. [2019-09-10 02:31:06,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:06,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:31:06,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:31:06,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:31:06,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:06,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:31:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:06,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:31:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:07,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-10 02:31:07,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:31:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 28 proven. 52943 refuted. 0 times theorem prover too weak. 3988 trivial. 0 not checked. [2019-09-10 02:31:08,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:31:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 163 proven. 52808 refuted. 0 times theorem prover too weak. 3988 trivial. 0 not checked. [2019-09-10 02:31:11,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:31:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32, 32] total 86 [2019-09-10 02:31:11,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:31:11,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:31:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:31:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:31:11,554 INFO L87 Difference]: Start difference. First operand 397 states and 427 transitions. Second operand 56 states. [2019-09-10 02:31:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,894 INFO L93 Difference]: Finished difference Result 467 states and 501 transitions. [2019-09-10 02:31:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2019-09-10 02:31:31,895 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 445 [2019-09-10 02:31:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,898 INFO L225 Difference]: With dead ends: 467 [2019-09-10 02:31:31,898 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 02:31:31,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65805 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=13557, Invalid=171773, Unknown=0, NotChecked=0, Total=185330 [2019-09-10 02:31:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 02:31:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 439. [2019-09-10 02:31:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-10 02:31:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 471 transitions. [2019-09-10 02:31:31,915 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 471 transitions. Word has length 445 [2019-09-10 02:31:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,915 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 471 transitions. [2019-09-10 02:31:31,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:31:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 471 transitions. [2019-09-10 02:31:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 02:31:31,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,920 INFO L399 BasicCegarLoop]: trace histogram [360, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:31,920 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash -941629629, now seen corresponding path program 20 times [2019-09-10 02:31:31,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 70905 backedges. 8795 proven. 300 refuted. 0 times theorem prover too weak. 61810 trivial. 0 not checked. [2019-09-10 02:31:32,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:32,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:31:32,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:31:32,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:31:32,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:32,791 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) [2019-09-10 02:31:32,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:31:32,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000