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/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:39:33,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:39:33,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:39:33,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:39:33,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:39:33,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:39:33,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:39:33,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:39:33,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:39:33,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:39:33,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:39:33,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:39:33,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:39:33,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:39:33,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:39:33,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:39:33,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:39:33,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:39:33,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:39:33,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:39:33,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:39:33,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:39:33,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:39:33,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:39:34,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:39:34,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:39:34,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:39:34,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:39:34,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:39:34,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:39:34,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:39:34,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:39:34,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:39:34,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:39:34,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:39:34,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:39:34,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:39:34,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:39:34,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:39:34,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:39:34,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:39:34,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:39:34,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:39:34,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:39:34,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:39:34,029 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:39:34,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:39:34,030 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:39:34,030 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:39:34,030 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:39:34,030 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:39:34,031 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:39:34,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:39:34,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:39:34,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:39:34,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:39:34,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:39:34,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:39:34,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:39:34,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:39:34,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:39:34,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:39:34,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:39:34,035 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:39:34,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:39:34,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:39:34,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:39:34,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:39:34,036 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:39:34,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:39:34,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:39:34,037 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:39:34,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:39:34,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:39:34,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:39:34,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:39:34,095 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:39:34,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2019-09-03 20:39:34,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273449c6c/a8b2ed3b64e44447ad7cdb0f82ccab29/FLAGac0d67256 [2019-09-03 20:39:34,659 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:39:34,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2019-09-03 20:39:34,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273449c6c/a8b2ed3b64e44447ad7cdb0f82ccab29/FLAGac0d67256 [2019-09-03 20:39:35,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273449c6c/a8b2ed3b64e44447ad7cdb0f82ccab29 [2019-09-03 20:39:35,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:39:35,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:39:35,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:39:35,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:39:35,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:39:35,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9b9e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35, skipping insertion in model container [2019-09-03 20:39:35,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:39:35,049 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:39:35,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:39:35,216 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:39:35,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:39:35,249 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:39:35,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35 WrapperNode [2019-09-03 20:39:35,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:39:35,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:39:35,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:39:35,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:39:35,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... [2019-09-03 20:39:35,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:39:35,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:39:35,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:39:35,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:39:35,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:39:35,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:39:35,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:39:35,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:39:35,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:39:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:39:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:39:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:39:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:39:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:39:35,602 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:39:35,602 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:39:35,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:39:35 BoogieIcfgContainer [2019-09-03 20:39:35,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:39:35,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:39:35,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:39:35,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:39:35,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:39:35" (1/3) ... [2019-09-03 20:39:35,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b510b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:39:35, skipping insertion in model container [2019-09-03 20:39:35,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:39:35" (2/3) ... [2019-09-03 20:39:35,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b510b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:39:35, skipping insertion in model container [2019-09-03 20:39:35,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:39:35" (3/3) ... [2019-09-03 20:39:35,612 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-2.c [2019-09-03 20:39:35,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:39:35,629 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:39:35,647 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:39:35,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:39:35,675 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:39:35,675 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:39:35,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:39:35,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:39:35,676 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:39:35,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:39:35,676 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:39:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 20:39:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:39:35,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:35,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:35,706 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 20:39:35,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:39:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:39:35,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:39:35,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:39:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:39:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:39:35,837 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 20:39:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:35,851 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-03 20:39:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:39:35,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:39:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:35,861 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:39:35,861 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:39:35,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:39:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:39:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:39:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:39:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 20:39:35,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 20:39:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:35,897 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 20:39:35,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:39:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 20:39:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:39:35,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:35,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:35,898 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-03 20:39:35,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:35,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:39:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:39:36,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:39:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:39:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:39:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:39:36,022 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 20:39:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:36,049 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-03 20:39:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:39:36,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:39:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:36,050 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:39:36,051 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:39:36,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:39:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:39:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:39:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:39:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:39:36,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:39:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:36,057 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:39:36,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:39:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:39:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:39:36,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:36,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:36,059 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-03 20:39:36,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:36,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:36,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:36,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:36,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:36,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:36,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:36,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:39:36,241 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:39:36,273 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:39:36,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:39:36,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:39:36,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:39:36,892 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 13. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:39:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:36,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:39:36,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:36,897 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) [2019-09-03 20:39:36,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:36,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:36,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:39:36,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:39:37,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:37,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:39:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:39:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:39:37,082 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 20:39:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:37,124 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-03 20:39:37,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:39:37,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:39:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:37,126 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:39:37,126 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:39:37,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:39:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:39:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:39:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:39:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-03 20:39:37,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-03 20:39:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:37,132 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-03 20:39:37,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:39:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-03 20:39:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:39:37,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:37,134 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:37,134 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-03 20:39:37,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:37,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:37,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:37,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:37,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:37,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:39:37,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:37,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:37,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:39:37,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:37,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:39:37,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:39:37,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:39:37,320 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:39:37,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-09-03 20:39:37,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:39:37,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:39:37,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:39:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:39:37,322 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-03 20:39:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:37,346 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-03 20:39:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:39:37,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:39:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:37,348 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:39:37,348 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:39:37,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:39:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:39:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:39:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:39:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:39:37,352 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-03 20:39:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:37,353 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:39:37,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:39:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:39:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:39:37,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:37,354 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:37,354 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-03 20:39:37,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:37,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:37,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:37,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:37,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 20:39:37,450 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:39:37,452 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:39:37,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:39:37,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:39:37,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:39:37,688 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 104 root evaluator evaluations with a maximum evaluation depth of 13. Performed 104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-03 20:39:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:37,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:39:37,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:37,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:39:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:37,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:37,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:39:37,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:37,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:37,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-03 20:39:37,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:37,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:39:37,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:39:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:39:37,893 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 20:39:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:37,939 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:39:37,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:39:37,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 20:39:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:37,941 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:39:37,941 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:39:37,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:39:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:39:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:39:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:39:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 20:39:37,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-03 20:39:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:37,946 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 20:39:37,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:39:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 20:39:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:39:37,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:37,947 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:37,947 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-03 20:39:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:37,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:38,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:38,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:38,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:38,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:38,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:38,069 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-03 20:39:38,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:38,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:38,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:39:38,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:38,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:39:38,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:39:38,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:39:38,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:38,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2019-09-03 20:39:38,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:38,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:39:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:39:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:39:38,180 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-03 20:39:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:42,441 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-03 20:39:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:39:42,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 20:39:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:42,444 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:39:42,445 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:39:42,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:39:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:39:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-03 20:39:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:39:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:39:42,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-03 20:39:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:42,451 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:39:42,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:39:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:39:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:39:42,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:42,452 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:42,452 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-03 20:39:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:42,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:42,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:42,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:42,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:42,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:42,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:42,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:42,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:39:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:42,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:42,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:42,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:42,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:39:42,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:42,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:42,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:42,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-03 20:39:42,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:42,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:39:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:39:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:39:42,866 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-03 20:39:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:42,959 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-03 20:39:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:39:42,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-03 20:39:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:42,962 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:39:42,962 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:39:42,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:39:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:39:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:39:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:39:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-03 20:39:42,970 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-03 20:39:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:42,971 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-03 20:39:42,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:39:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-03 20:39:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:39:42,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:42,976 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:42,977 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-03 20:39:42,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:42,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:42,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:42,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:43,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:43,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:43,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:43,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:43,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:43,158 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-03 20:39:43,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:43,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:43,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:39:43,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:43,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:43,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:43,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 20:39:43,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:43,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:39:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:39:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:39:43,528 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-03 20:39:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:43,665 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:39:43,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:39:43,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-03 20:39:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:43,669 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:39:43,669 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:39:43,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:39:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:39:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:39:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:39:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 20:39:43,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-03 20:39:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:43,674 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 20:39:43,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:39:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 20:39:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:39:43,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:43,675 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:43,675 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:43,676 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-03 20:39:43,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:43,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:39:43,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:43,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:43,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:43,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:43,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:43,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:39:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:43,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:43,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:39:43,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:43,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:39:43,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:39:43,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:39:44,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2019-09-03 20:39:44,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:44,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:39:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:39:44,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:39:44,060 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-03 20:39:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:49,681 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-09-03 20:39:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:39:49,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 20:39:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:49,683 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:39:49,683 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:39:49,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:39:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:39:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-03 20:39:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:39:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 20:39:49,688 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-03 20:39:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:49,688 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 20:39:49,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:39:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 20:39:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:39:49,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:49,689 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:49,690 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-03 20:39:49,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:49,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:49,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:49,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:49,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:49,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:49,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:49,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:49,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:49,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:49,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:49,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:49,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:39:49,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:49,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:50,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:50,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-03 20:39:50,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:50,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:39:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:39:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:39:50,291 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-03 20:39:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:50,448 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-03 20:39:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:39:50,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-03 20:39:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:50,451 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:39:50,451 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:39:50,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:39:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:39:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:39:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:39:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-03 20:39:50,457 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-03 20:39:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:50,458 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-03 20:39:50,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:39:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-03 20:39:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:39:50,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:50,459 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:50,459 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-03 20:39:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:50,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:50,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:50,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:50,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:50,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:50,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:50,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:50,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:50,637 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-03 20:39:50,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:50,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:50,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:39:50,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:50,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:51,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:51,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-03 20:39:51,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:51,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:39:51,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:39:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:39:51,100 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-03 20:39:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:51,339 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-03 20:39:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:39:51,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-03 20:39:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:51,341 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:39:51,341 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:39:51,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:39:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:39:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:39:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:39:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-03 20:39:51,347 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-03 20:39:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:51,347 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-03 20:39:51,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:39:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-03 20:39:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:39:51,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:51,349 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:51,349 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-03 20:39:51,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:51,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:51,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:39:51,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:51,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:51,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:51,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:51,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:51,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:51,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:51,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:39:51,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:51,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:39:51,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 20:39:51,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 20:39:51,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:51,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2019-09-03 20:39:51,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:51,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:39:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:39:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:39:51,855 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-03 20:39:54,895 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:40:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:03,454 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-03 20:40:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:40:03,454 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 20:40:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:03,455 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:40:03,455 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:40:03,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=173, Invalid=378, Unknown=1, NotChecked=0, Total=552 [2019-09-03 20:40:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:40:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-03 20:40:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:40:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:40:03,460 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-03 20:40:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:03,461 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:40:03,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:40:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:40:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:40:03,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:03,462 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:03,462 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-03 20:40:03,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:03,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:03,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:03,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:03,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:03,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:03,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:03,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:03,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:40:03,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:40:03,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:03,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:03,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:40:03,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:03,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:04,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:04,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-03 20:40:04,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:04,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:40:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:40:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:40:04,494 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-03 20:40:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:04,750 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 20:40:04,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:40:04,755 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-03 20:40:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:04,755 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:40:04,755 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:40:04,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:40:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:40:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:40:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:40:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 20:40:04,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-03 20:40:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:04,760 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 20:40:04,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:40:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 20:40:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:40:04,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:04,761 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:04,762 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:04,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-03 20:40:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:04,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:04,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:05,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:05,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:05,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:05,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:05,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:05,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:40:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:05,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:05,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:40:05,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:05,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:05,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-03 20:40:05,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:05,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:40:05,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:40:05,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:40:05,787 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-03 20:40:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:06,129 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 20:40:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:40:06,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-03 20:40:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:06,131 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:40:06,132 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:40:06,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:40:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:40:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:40:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:40:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 20:40:06,139 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-03 20:40:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:06,140 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 20:40:06,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:40:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 20:40:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:40:06,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:06,141 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:06,141 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-03 20:40:06,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:06,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:06,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:40:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:06,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:06,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:06,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:06,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:06,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:40:56,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:40:56,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:56,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:40:56,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:40:56,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:40:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 27 [2019-09-03 20:40:57,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:57,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:40:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:40:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:40:57,206 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 21 states. [2019-09-03 20:41:03,392 WARN L188 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:41:05,010 WARN L188 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:41:12,582 WARN L188 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:41:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:30,323 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-03 20:41:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:41:30,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-09-03 20:41:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:30,324 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:41:30,324 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:41:30,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=341, Invalid=780, Unknown=1, NotChecked=0, Total=1122 [2019-09-03 20:41:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:41:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-09-03 20:41:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:41:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-03 20:41:30,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-03 20:41:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:30,330 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-03 20:41:30,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:41:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-03 20:41:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:41:30,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:30,332 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:30,332 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-03 20:41:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:30,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:30,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:30,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:30,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:30,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:30,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:30,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:30,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:30,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:30,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:30,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:30,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:41:30,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:30,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:31,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-03 20:41:31,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:31,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:41:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:41:31,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:41:31,599 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-03 20:41:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:32,064 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-03 20:41:32,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:41:32,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-03 20:41:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:32,067 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:41:32,068 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:41:32,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:41:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:41:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 20:41:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:41:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 20:41:32,072 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-03 20:41:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:32,072 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 20:41:32,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:41:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 20:41:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:41:32,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:32,074 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:32,074 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-03 20:41:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:32,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:32,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:32,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:32,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:32,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:32,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:32,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:32,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:32,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:32,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:32,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:41:32,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:32,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-03 20:41:33,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:33,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:41:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:41:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:41:33,313 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-03 20:41:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:33,785 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-03 20:41:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:41:33,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-03 20:41:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:33,786 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:41:33,786 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:41:33,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:41:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:41:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 20:41:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:41:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-03 20:41:33,791 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-03 20:41:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:33,792 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-03 20:41:33,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:41:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-03 20:41:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:41:33,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:33,793 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:33,793 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-03 20:41:33,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:33,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:33,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:33,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:33,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:41:34,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:34,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:34,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:34,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:34,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:34,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:34,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:34,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:18,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:42:18,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:19,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:42:19,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:42:19,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:42:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:19,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2019-09-03 20:42:19,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:19,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:42:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:42:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:42:19,558 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-03 20:42:20,857 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:42:23,907 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:42:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:38,504 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-09-03 20:42:38,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:42:38,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 20:42:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:38,505 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:42:38,505 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:42:38,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=370, Invalid=888, Unknown=2, NotChecked=0, Total=1260 [2019-09-03 20:42:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:42:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-09-03 20:42:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:42:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-03 20:42:38,509 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 50 [2019-09-03 20:42:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:38,510 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-03 20:42:38,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:42:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-03 20:42:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:42:38,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:38,511 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:38,511 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-03 20:42:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:38,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:38,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:38,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:38,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:38,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:38,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:38,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:38,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:38,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:38,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:38,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:38,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:38,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:42:38,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:39,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:40,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-03 20:42:40,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:40,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:42:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:42:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:42:40,259 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 20 states. [2019-09-03 20:42:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:40,742 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-03 20:42:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:42:40,743 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-03 20:42:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:40,744 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:42:40,744 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:42:40,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:42:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:42:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-03 20:42:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:42:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-09-03 20:42:40,750 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 54 [2019-09-03 20:42:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:40,750 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-09-03 20:42:40,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:42:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-09-03 20:42:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:42:40,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:40,753 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:40,753 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-03 20:42:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:40,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:40,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:41,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:41,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:41,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:41,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:41,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:41,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:41,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:41,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:42:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:41,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 304 refuted. 2 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-03 20:42:44,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:44,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:42:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:42:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1102, Unknown=1, NotChecked=0, Total=1560 [2019-09-03 20:42:44,712 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 21 states. [2019-09-03 20:42:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:45,301 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-03 20:42:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:42:45,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-03 20:42:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:45,302 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:42:45,303 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:42:45,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=457, Invalid=1102, Unknown=1, NotChecked=0, Total=1560 [2019-09-03 20:42:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:42:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:42:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:42:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-03 20:42:45,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 56 [2019-09-03 20:42:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:45,307 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-03 20:42:45,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:42:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-03 20:42:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:42:45,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:45,308 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:45,308 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-03 20:42:45,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:45,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:45,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:45,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:45,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:42:45,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:45,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:45,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:45,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:45,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:45,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:45,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:43:45,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:43:45,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:46,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:43:46,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 20:43:46,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 20:43:46,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:46,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 35 [2019-09-03 20:43:46,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:46,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:43:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:43:46,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:43:46,852 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 28 states. [2019-09-03 20:43:50,005 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:44:00,912 WARN L188 SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:44:06,491 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:44:11,171 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:44:23,845 WARN L188 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:44:30,166 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:44:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:40,326 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-03 20:44:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:44:40,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 20:44:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:40,327 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:44:40,327 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:44:40,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=546, Invalid=1343, Unknown=3, NotChecked=0, Total=1892 [2019-09-03 20:44:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:44:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-09-03 20:44:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:44:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-09-03 20:44:40,331 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-09-03 20:44:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:40,332 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-09-03 20:44:40,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:44:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-09-03 20:44:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:44:40,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:40,333 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:40,333 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-03 20:44:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:40,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:40,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:40,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:40,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:40,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:40,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:44:40,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:44:40,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:44:40,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:44:40,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:44:40,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:40,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 378 refuted. 2 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-03 20:44:45,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:45,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:44:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:44:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-03 20:44:45,263 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 23 states. [2019-09-03 20:44:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:46,003 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-03 20:44:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:44:46,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-03 20:44:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:46,008 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:44:46,008 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:44:46,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-03 20:44:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:44:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-03 20:44:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:44:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-09-03 20:44:46,013 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 62 [2019-09-03 20:44:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:46,013 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-09-03 20:44:46,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:44:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-09-03 20:44:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:44:46,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:46,014 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:46,015 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-03 20:44:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:46,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:46,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:46,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:46,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:46,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:46,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:46,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:46,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:44:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:46,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:44:46,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:46,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:48,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-03 20:44:48,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:48,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:44:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:44:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:44:48,671 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 24 states. [2019-09-03 20:44:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:49,460 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-09-03 20:44:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:44:49,461 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-03 20:44:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:49,462 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:44:49,462 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:44:49,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:44:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:44:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 20:44:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:44:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-09-03 20:44:49,466 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 64 [2019-09-03 20:44:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:49,466 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-09-03 20:44:49,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:44:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-09-03 20:44:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:44:49,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:49,467 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:49,468 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-03 20:44:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:49,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:44:49,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:49,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:49,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:49,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:49,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:49,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:49,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:49,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)