java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:25:20,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:20,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:20,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:20,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:20,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:20,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:20,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:20,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:20,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:20,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:20,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:20,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:20,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:20,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:20,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:20,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:20,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:20,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:20,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:20,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:20,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:20,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:20,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:20,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:20,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:20,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:20,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:20,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:20,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:20,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:20,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:20,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:20,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:20,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:20,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:20,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:20,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:20,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:20,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:20,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:20,619 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-20 13:25:20,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:20,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:20,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:20,647 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:20,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:20,648 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:20,648 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:20,648 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:20,648 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:20,648 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:20,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:20,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:20,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:20,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:20,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:20,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:20,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:20,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:20,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:20,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:20,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:20,654 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:20,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:20,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:20,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:20,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:20,655 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:20,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:20,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:20,656 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:20,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:20,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:20,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:20,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:20,720 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:20,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-20 13:25:20,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813b2e4ee/6c91d8cf576340249ac6f54709343b6f/FLAG7176e2b72 [2019-09-20 13:25:21,262 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:21,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-20 13:25:21,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813b2e4ee/6c91d8cf576340249ac6f54709343b6f/FLAG7176e2b72 [2019-09-20 13:25:21,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813b2e4ee/6c91d8cf576340249ac6f54709343b6f [2019-09-20 13:25:21,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:21,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:21,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:21,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:21,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:21,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca636ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21, skipping insertion in model container [2019-09-20 13:25:21,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:21,658 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:21,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:21,826 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:21,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:21,858 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:21,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21 WrapperNode [2019-09-20 13:25:21,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:21,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:21,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:21,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:21,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (1/1) ... [2019-09-20 13:25:21,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:21,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:21,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:21,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:21,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (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-20 13:25:22,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:22,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:22,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 13:25:22,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:22,204 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:22,205 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:25:22,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:22 BoogieIcfgContainer [2019-09-20 13:25:22,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:22,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:22,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:22,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:22,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:21" (1/3) ... [2019-09-20 13:25:22,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9181920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:22, skipping insertion in model container [2019-09-20 13:25:22,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:21" (2/3) ... [2019-09-20 13:25:22,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9181920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:22, skipping insertion in model container [2019-09-20 13:25:22,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:22" (3/3) ... [2019-09-20 13:25:22,215 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-09-20 13:25:22,225 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:22,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:25:22,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:25:22,293 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:22,296 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:22,297 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:22,297 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:22,297 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:22,297 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:22,297 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:22,297 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-20 13:25:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:25:22,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,340 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:22,343 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-20 13:25:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,596 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-20 13:25:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:22,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,616 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-20 13:25:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,652 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-20 13:25:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:22,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-20 13:25:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,664 INFO L225 Difference]: With dead ends: 22 [2019-09-20 13:25:22,664 INFO L226 Difference]: Without dead ends: 16 [2019-09-20 13:25:22,666 INFO L636 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-20 13:25:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-20 13:25:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-20 13:25:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-20 13:25:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-20 13:25:22,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-20 13:25:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,701 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-20 13:25:22,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-20 13:25:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:25:22,702 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,702 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:22,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-20 13:25:22,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:22,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:22,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,762 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-20 13:25:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:22,774 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-20 13:25:22,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:22,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-20 13:25:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:22,776 INFO L225 Difference]: With dead ends: 15 [2019-09-20 13:25:22,776 INFO L226 Difference]: Without dead ends: 15 [2019-09-20 13:25:22,777 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-20 13:25:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-20 13:25:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-20 13:25:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-20 13:25:22,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-20 13:25:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:22,781 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-20 13:25:22,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-20 13:25:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:22,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:22,782 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:22,782 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-20 13:25:22,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:22,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:22,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:22,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:22,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-20 13:25:22,857 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-20 13:25:22,890 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:22,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:22,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:25:23,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:23,344 INFO L272 AbstractInterpreter]: Visited 14 different actions 110 times. Merged at 5 different actions 44 times. Widened at 3 different actions 17 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 12. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 14 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-20 13:25:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:23,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:23,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:23,350 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-20 13:25:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:23,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:23,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:25:23,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:23,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:25:23,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:23,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-20 13:25:23,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:23,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:25:23,532 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-20 13:25:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:23,661 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-20 13:25:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:25:23,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-20 13:25:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:23,664 INFO L225 Difference]: With dead ends: 25 [2019-09-20 13:25:23,664 INFO L226 Difference]: Without dead ends: 25 [2019-09-20 13:25:23,665 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:25:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-20 13:25:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-20 13:25:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 13:25:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-20 13:25:23,670 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-20 13:25:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:23,671 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-20 13:25:23,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-20 13:25:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:25:23,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:23,674 INFO L407 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:23,674 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-20 13:25:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:23,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:25:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:23,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:23,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:23,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:23,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:23,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:23,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:23,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-20 13:25:23,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-20 13:25:23,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:25:23,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 13:25:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 13 [2019-09-20 13:25:24,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:24,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:25:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:25:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:25:24,011 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2019-09-20 13:25:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:24,227 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-20 13:25:24,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:25:24,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-20 13:25:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:24,228 INFO L225 Difference]: With dead ends: 34 [2019-09-20 13:25:24,228 INFO L226 Difference]: Without dead ends: 34 [2019-09-20 13:25:24,229 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:25:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-20 13:25:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-20 13:25:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 13:25:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-20 13:25:24,234 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-20 13:25:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:24,235 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-20 13:25:24,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:25:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-20 13:25:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:25:24,236 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:24,236 INFO L407 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:24,237 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-20 13:25:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:24,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:24,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 13:25:24,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:24,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:24,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:24,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:24,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:24,374 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-20 13:25:24,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:24,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:24,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:24,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:24,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 13:25:24,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:25:24,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-20 13:25:24,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-20 13:25:24,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:24,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:25:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:25:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:25:24,641 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-20 13:25:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:24,993 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-20 13:25:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-20 13:25:24,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-20 13:25:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:24,995 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:25:24,995 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:25:24,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:25:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:25:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-20 13:25:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-20 13:25:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-20 13:25:25,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-20 13:25:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:25,002 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-20 13:25:25,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:25:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-20 13:25:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:25:25,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:25,004 INFO L407 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:25,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-20 13:25:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:25,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-20 13:25:25,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:25,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:25,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:25,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:25,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:25,179 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-20 13:25:25,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:25,206 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-20 13:25:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:25,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-20 13:25:25,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:25:25,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 13:25:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-20 13:25:25,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:25,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:25:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:25:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:25:25,512 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-20 13:25:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:26,160 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-20 13:25:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-20 13:25:26,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-20 13:25:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:26,162 INFO L225 Difference]: With dead ends: 58 [2019-09-20 13:25:26,162 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 13:25:26,164 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-20 13:25:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 13:25:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-20 13:25:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-20 13:25:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-20 13:25:26,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-20 13:25:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:26,172 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-20 13:25:26,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:25:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-20 13:25:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:25:26,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:26,174 INFO L407 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:26,174 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-20 13:25:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:26,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-20 13:25:26,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:26,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:26,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:26,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:26,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:26,302 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-20 13:25:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:26,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:25:26,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-20 13:25:26,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:26,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-20 13:25:26,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-20 13:25:26,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-20 13:25:26,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:26,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-20 13:25:26,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:26,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:25:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:25:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:25:26,567 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-20 13:25:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:26,624 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-20 13:25:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:26,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-20 13:25:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:26,627 INFO L225 Difference]: With dead ends: 56 [2019-09-20 13:25:26,627 INFO L226 Difference]: Without dead ends: 56 [2019-09-20 13:25:26,627 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:25:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-20 13:25:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-20 13:25:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:25:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-20 13:25:26,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-20 13:25:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:26,636 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-20 13:25:26,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:25:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-20 13:25:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:25:26,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:26,638 INFO L407 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:26,638 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-20 13:25:26,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:26,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-20 13:25:26,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:26,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:26,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:26,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:26,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:26,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:26,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:26,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:26,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:26,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-20 13:25:26,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:25:27,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:25:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-20 13:25:27,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:27,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:25:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:25:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:25:27,601 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-20 13:25:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:28,861 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-20 13:25:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-20 13:25:28,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-20 13:25:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:28,863 INFO L225 Difference]: With dead ends: 80 [2019-09-20 13:25:28,864 INFO L226 Difference]: Without dead ends: 80 [2019-09-20 13:25:28,866 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-20 13:25:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-20 13:25:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-20 13:25:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-20 13:25:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-20 13:25:28,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-20 13:25:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:28,873 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-20 13:25:28,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:25:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-20 13:25:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:25:28,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:28,875 INFO L407 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:28,875 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-20 13:25:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-20 13:25:29,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:29,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:29,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:29,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:29,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:29,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:29,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:29,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:25:29,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-20 13:25:29,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:25:29,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:29,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-20 13:25:29,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:29,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-20 13:25:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-20 13:25:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-20 13:25:29,921 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-20 13:25:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:31,580 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-20 13:25:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-20 13:25:31,585 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-20 13:25:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:31,587 INFO L225 Difference]: With dead ends: 98 [2019-09-20 13:25:31,587 INFO L226 Difference]: Without dead ends: 98 [2019-09-20 13:25:31,590 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-20 13:25:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-20 13:25:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-20 13:25:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:25:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-20 13:25:31,596 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-20 13:25:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:31,597 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-20 13:25:31,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-20 13:25:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-20 13:25:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:25:31,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:31,598 INFO L407 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:31,599 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-20 13:25:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:31,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-20 13:25:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:31,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:31,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:31,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:31,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:31,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:31,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:32,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-20 13:25:32,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:32,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:25:32,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-20 13:25:32,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-20 13:25:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:32,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-20 13:25:32,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:32,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:25:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:25:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:25:32,237 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-20 13:25:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,355 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-20 13:25:32,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:25:32,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-20 13:25:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,357 INFO L225 Difference]: With dead ends: 95 [2019-09-20 13:25:32,357 INFO L226 Difference]: Without dead ends: 95 [2019-09-20 13:25:32,357 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:25:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-20 13:25:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-20 13:25:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-20 13:25:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-20 13:25:32,364 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-20 13:25:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,364 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-20 13:25:32,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:25:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-20 13:25:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:25:32,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,366 INFO L407 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:32,366 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-20 13:25:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-20 13:25:32,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:32,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:32,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:32,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:32,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:32,584 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-20 13:25:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:32,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:32,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:32,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:32,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 13:25:32,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-20 13:25:32,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-20 13:25:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:33,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-20 13:25:33,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:33,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-20 13:25:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-20 13:25:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-20 13:25:33,663 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-20 13:25:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:36,655 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-20 13:25:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-20 13:25:36,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-20 13:25:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:36,656 INFO L225 Difference]: With dead ends: 127 [2019-09-20 13:25:36,657 INFO L226 Difference]: Without dead ends: 127 [2019-09-20 13:25:36,662 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-20 13:25:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-20 13:25:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-20 13:25:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-20 13:25:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-20 13:25:36,678 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-20 13:25:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:36,679 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-20 13:25:36,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-20 13:25:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-20 13:25:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:25:36,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:36,681 INFO L407 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:36,681 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-20 13:25:36,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-20 13:25:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:36,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:36,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:36,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:36,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:36,990 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-20 13:25:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-20 13:25:37,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-20 13:25:37,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:25:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-20 13:25:38,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:38,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:25:38,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:25:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-20 13:25:38,578 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-20 13:25:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,101 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-20 13:25:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 13:25:39,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-20 13:25:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,104 INFO L225 Difference]: With dead ends: 140 [2019-09-20 13:25:39,104 INFO L226 Difference]: Without dead ends: 140 [2019-09-20 13:25:39,105 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-20 13:25:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-20 13:25:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-20 13:25:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-20 13:25:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-20 13:25:39,112 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-20 13:25:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,113 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-20 13:25:39,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:25:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-20 13:25:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:25:39,115 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,115 INFO L407 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,115 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-20 13:25:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-20 13:25:39,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:39,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:39,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:39,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:39,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:39,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:39,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:25:39,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-20 13:25:39,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:39,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:25:39,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:39,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:39,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:39,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:39,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:39,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:52,450 WARN L191 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-20 13:26:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2019-09-20 13:26:00,692 INFO L322 TraceCheckSpWp]: Computing backward predicates...