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/recursive-simple/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:05:15,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:05:15,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:05:15,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:05:15,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:05:15,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:05:15,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:05:15,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:05:15,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:05:15,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:05:15,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:05:15,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:05:15,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:05:15,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:05:15,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:05:15,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:05:15,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:05:15,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:05:15,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:05:15,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:05:15,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:05:15,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:05:15,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:05:15,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:05:15,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:05:15,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:05:15,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:05:15,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:05:15,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:05:15,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:05:15,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:05:15,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:05:15,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:05:15,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:05:15,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:05:15,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:05:15,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:05:15,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:05:15,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:05:15,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:05:15,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:05:15,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:05:15,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:05:15,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:05:15,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:05:15,116 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:05:15,117 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:05:15,117 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:05:15,118 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:05:15,118 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:05:15,118 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:05:15,118 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:05:15,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:05:15,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:05:15,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:05:15,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:05:15,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:05:15,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:05:15,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:05:15,120 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:05:15,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:05:15,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:05:15,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:05:15,121 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:05:15,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:05:15,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:05:15,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:05:15,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:05:15,122 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:05:15,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:05:15,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:05:15,122 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:05:15,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:05:15,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:05:15,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:05:15,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:05:15,166 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:05:15,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2019-09-10 03:05:15,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472411405/5ae44fa3ac91488e8a3ab4e79c4dc1b0/FLAG0a2d173c5 [2019-09-10 03:05:15,646 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:05:15,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2019-09-10 03:05:15,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472411405/5ae44fa3ac91488e8a3ab4e79c4dc1b0/FLAG0a2d173c5 [2019-09-10 03:05:16,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472411405/5ae44fa3ac91488e8a3ab4e79c4dc1b0 [2019-09-10 03:05:16,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:05:16,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:05:16,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:16,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:05:16,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:05:16,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c69540a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16, skipping insertion in model container [2019-09-10 03:05:16,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:05:16,096 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:05:16,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:16,349 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:05:16,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:16,387 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:05:16,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16 WrapperNode [2019-09-10 03:05:16,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:16,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:05:16,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:05:16,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:05:16,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... [2019-09-10 03:05:16,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:05:16,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:05:16,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:05:16,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:05:16,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:05:16,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:05:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:05:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-10 03:05:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-10 03:05:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:05:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:05:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:05:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-10 03:05:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-10 03:05:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:05:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:05:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:05:16,826 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:05:16,827 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:05:16,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:16 BoogieIcfgContainer [2019-09-10 03:05:16,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:05:16,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:05:16,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:05:16,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:05:16,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:05:16" (1/3) ... [2019-09-10 03:05:16,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308e3ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:16, skipping insertion in model container [2019-09-10 03:05:16,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:16" (2/3) ... [2019-09-10 03:05:16,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308e3ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:16, skipping insertion in model container [2019-09-10 03:05:16,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:16" (3/3) ... [2019-09-10 03:05:16,837 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2019-09-10 03:05:16,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:05:16,855 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:05:16,873 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:05:16,914 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:05:16,914 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:05:16,914 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:05:16,914 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:05:16,915 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:05:16,915 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:05:16,915 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:05:16,915 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:05:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-10 03:05:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:05:16,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:16,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:16,950 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-10 03:05:16,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:17,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:17,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:17,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:17,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:17,149 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-10 03:05:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:17,253 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-10 03:05:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:17,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:05:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:17,265 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:05:17,265 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:05:17,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:05:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:05:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:05:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:17,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-10 03:05:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:17,311 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:17,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 03:05:17,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:17,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:17,314 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-10 03:05:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:17,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:17,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:17,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:17,366 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-10 03:05:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:17,429 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-09-10 03:05:17,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:17,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 03:05:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:17,431 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:05:17,432 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 03:05:17,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:05:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 03:05:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 03:05:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:17,441 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-10 03:05:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:17,441 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:17,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 03:05:17,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:17,444 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:17,445 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-10 03:05:17,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:17,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:05:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:17,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:17,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 03:05:17,568 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2019-09-10 03:05:17,599 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:17,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:17,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:17,663 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 8 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:17,667 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:17,717 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:17,718 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:17,770 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 03:05:17,771 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:17,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:17,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-10 03:05:17,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:17,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:05:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:05:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:05:17,776 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2019-09-10 03:05:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:18,003 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-10 03:05:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:05:18,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-10 03:05:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:18,005 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:05:18,006 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:05:18,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:05:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-10 03:05:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 03:05:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-10 03:05:18,023 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2019-09-10 03:05:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:18,023 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-10 03:05:18,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:05:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-10 03:05:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:05:18,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:18,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:18,029 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-10 03:05:18,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:18,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:05:18,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:18,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:18,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2019-09-10 03:05:18,154 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:18,156 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:18,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:18,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:18,208 INFO L272 AbstractInterpreter]: Visited 28 different actions 72 times. Merged at 2 different actions 2 times. Widened at 2 different actions 2 times. Performed 69 root evaluator evaluations with a maximum evaluation depth of 3. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2019-09-10 03:05:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:18,208 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:18,227 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:18,227 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:18,296 INFO L420 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2019-09-10 03:05:18,296 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:18,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:18,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-10 03:05:18,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:18,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:05:18,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:05:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:18,298 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2019-09-10 03:05:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:18,598 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-10 03:05:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:05:18,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-10 03:05:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:18,602 INFO L225 Difference]: With dead ends: 55 [2019-09-10 03:05:18,603 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 03:05:18,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:05:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 03:05:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-10 03:05:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 03:05:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-10 03:05:18,616 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2019-09-10 03:05:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:18,617 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-10 03:05:18,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:05:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-10 03:05:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:05:18,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:18,622 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:18,622 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2019-09-10 03:05:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:05:18,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:18,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:18,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:18,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:18,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:18,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:18,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:18,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:18,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:18,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:18,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:18,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 03:05:18,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:19,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2019-09-10 03:05:19,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:19,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:05:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:05:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:19,289 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2019-09-10 03:05:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:19,599 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2019-09-10 03:05:19,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:05:19,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-10 03:05:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:19,607 INFO L225 Difference]: With dead ends: 84 [2019-09-10 03:05:19,607 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 03:05:19,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:05:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 03:05:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-10 03:05:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 03:05:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-09-10 03:05:19,625 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2019-09-10 03:05:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:19,625 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-09-10 03:05:19,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:05:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-09-10 03:05:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:05:19,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:19,627 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:19,628 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2019-09-10 03:05:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:05:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:19,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:19,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-10 03:05:19,726 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:19,731 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:19,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:19,816 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:19,816 INFO L272 AbstractInterpreter]: Visited 29 different actions 178 times. Merged at 11 different actions 28 times. Widened at 2 different actions 2 times. Performed 204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 03:05:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,817 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:19,842 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:19,842 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:19,939 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-10 03:05:19,940 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2019-09-10 03:05:19,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:19,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:05:19,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:05:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:19,942 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 15 states. [2019-09-10 03:05:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:20,542 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-09-10 03:05:20,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:05:20,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-09-10 03:05:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:20,544 INFO L225 Difference]: With dead ends: 79 [2019-09-10 03:05:20,544 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 03:05:20,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:05:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 03:05:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-09-10 03:05:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-10 03:05:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2019-09-10 03:05:20,559 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2019-09-10 03:05:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:20,559 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2019-09-10 03:05:20,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:05:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2019-09-10 03:05:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:05:20,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:20,565 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:20,566 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:20,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2019-09-10 03:05:20,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:20,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 39 proven. 19 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-10 03:05:20,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:20,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:20,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2019-09-10 03:05:20,677 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:20,680 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:20,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:20,698 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:20,698 INFO L272 AbstractInterpreter]: Visited 27 different actions 94 times. Merged at 9 different actions 20 times. Widened at 2 different actions 2 times. Performed 107 root evaluator evaluations with a maximum evaluation depth of 3. Performed 107 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-10 03:05:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:20,699 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:20,713 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:20,714 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:20,770 INFO L420 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2019-09-10 03:05:20,770 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:20,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:20,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2019-09-10 03:05:20,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:20,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:20,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:20,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:05:20,772 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2019-09-10 03:05:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:21,262 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-09-10 03:05:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:05:21,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-10 03:05:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:21,265 INFO L225 Difference]: With dead ends: 86 [2019-09-10 03:05:21,266 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 03:05:21,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 03:05:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-10 03:05:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 03:05:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2019-09-10 03:05:21,276 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2019-09-10 03:05:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:21,277 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2019-09-10 03:05:21,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2019-09-10 03:05:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:05:21,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:21,279 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:21,280 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2019-09-10 03:05:21,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:21,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:21,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 47 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:05:21,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:21,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:21,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 03:05:21,433 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:21,439 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:21,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:21,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:05:21,615 INFO L272 AbstractInterpreter]: Visited 34 different actions 802 times. Merged at 16 different actions 102 times. Widened at 2 different actions 2 times. Performed 887 root evaluator evaluations with a maximum evaluation depth of 3. Performed 887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 5 variables. [2019-09-10 03:05:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:21,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:05:21,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:21,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:21,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:21,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:05:21,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:05:21,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:22,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:22,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:22,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:22,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:22,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 13] total 18 [2019-09-10 03:05:22,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:22,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:22,724 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 13 states. [2019-09-10 03:05:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:22,978 INFO L93 Difference]: Finished difference Result 188 states and 320 transitions. [2019-09-10 03:05:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:05:22,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-09-10 03:05:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:22,982 INFO L225 Difference]: With dead ends: 188 [2019-09-10 03:05:22,982 INFO L226 Difference]: Without dead ends: 162 [2019-09-10 03:05:22,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 169 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:05:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-10 03:05:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 93. [2019-09-10 03:05:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-10 03:05:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2019-09-10 03:05:23,009 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 94 [2019-09-10 03:05:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:23,011 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2019-09-10 03:05:23,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2019-09-10 03:05:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 03:05:23,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:23,016 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:23,016 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:23,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1353168305, now seen corresponding path program 2 times [2019-09-10 03:05:23,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:23,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:23,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:23,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 92 proven. 162 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 03:05:23,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:23,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:23,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:23,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:23,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:23,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:23,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:23,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:23,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:23,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:23,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:05:23,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 189 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-10 03:05:23,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:23,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 189 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:24,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:24,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 21 [2019-09-10 03:05:24,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:24,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:05:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:05:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:05:24,042 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 17 states. [2019-09-10 03:05:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:24,747 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2019-09-10 03:05:24,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 03:05:24,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2019-09-10 03:05:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:24,751 INFO L225 Difference]: With dead ends: 167 [2019-09-10 03:05:24,751 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 03:05:24,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 282 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:05:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 03:05:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2019-09-10 03:05:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 03:05:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-09-10 03:05:24,769 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 148 [2019-09-10 03:05:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:24,770 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-09-10 03:05:24,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:05:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-09-10 03:05:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 03:05:24,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:24,774 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:24,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2020632488, now seen corresponding path program 3 times [2019-09-10 03:05:24,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:24,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:24,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 81 proven. 110 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2019-09-10 03:05:24,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:24,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:24,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:24,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:24,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:24,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:24,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:05:24,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:24,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:24,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:05:24,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 03:05:25,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 81 proven. 110 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2019-09-10 03:05:25,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:05:25,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2019-09-10 03:05:25,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:25,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:05:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:05:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:05:25,410 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 6 states. [2019-09-10 03:05:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:25,454 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2019-09-10 03:05:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:05:25,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-10 03:05:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:25,457 INFO L225 Difference]: With dead ends: 140 [2019-09-10 03:05:25,457 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 03:05:25,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 364 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:05:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 03:05:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-10 03:05:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 03:05:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2019-09-10 03:05:25,472 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 184 [2019-09-10 03:05:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:25,472 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2019-09-10 03:05:25,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:05:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2019-09-10 03:05:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 03:05:25,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:25,491 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:25,491 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:25,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1847226520, now seen corresponding path program 4 times [2019-09-10 03:05:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:25,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:25,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:25,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 134 proven. 171 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2019-09-10 03:05:25,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:25,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:25,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:25,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:25,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:25,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:25,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:25,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:25,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 03:05:25,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 132 proven. 172 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-09-10 03:05:25,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:26,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:26,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 133 proven. 175 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:26,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:26,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 18 [2019-09-10 03:05:26,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:26,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:26,619 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand 13 states. [2019-09-10 03:05:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:26,828 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2019-09-10 03:05:26,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:05:26,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 218 [2019-09-10 03:05:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:26,831 INFO L225 Difference]: With dead ends: 186 [2019-09-10 03:05:26,831 INFO L226 Difference]: Without dead ends: 146 [2019-09-10 03:05:26,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 422 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:05:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-10 03:05:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-09-10 03:05:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 03:05:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-10 03:05:26,842 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 218 [2019-09-10 03:05:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:26,842 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-10 03:05:26,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-10 03:05:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 03:05:26,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:26,845 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:26,846 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1227327799, now seen corresponding path program 5 times [2019-09-10 03:05:26,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:26,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 93 proven. 115 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-10 03:05:26,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:26,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:26,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:26,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:26,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:26,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:26,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:26,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:27,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 03:05:27,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:27,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 03:05:27,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 308 proven. 3 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-10 03:05:27,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 161 proven. 21 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 03:05:27,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:27,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2019-09-10 03:05:27,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:27,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:27,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-10 03:05:27,537 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 13 states. [2019-09-10 03:05:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:27,872 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2019-09-10 03:05:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:05:27,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 175 [2019-09-10 03:05:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:27,874 INFO L225 Difference]: With dead ends: 167 [2019-09-10 03:05:27,875 INFO L226 Difference]: Without dead ends: 167 [2019-09-10 03:05:27,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:05:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-10 03:05:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2019-09-10 03:05:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 03:05:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2019-09-10 03:05:27,885 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 175 [2019-09-10 03:05:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:27,886 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2019-09-10 03:05:27,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2019-09-10 03:05:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 03:05:27,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:27,889 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:27,889 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -854759576, now seen corresponding path program 6 times [2019-09-10 03:05:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:27,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:27,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 213 proven. 46 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-09-10 03:05:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:28,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:28,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:28,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:28,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:28,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:05:28,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:28,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:28,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 03:05:28,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 211 proven. 47 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-09-10 03:05:28,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:28,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 210 proven. 52 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-10 03:05:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 18 [2019-09-10 03:05:28,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:28,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:28,985 INFO L87 Difference]: Start difference. First operand 143 states and 193 transitions. Second operand 13 states. [2019-09-10 03:05:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:29,138 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-09-10 03:05:29,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:05:29,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 191 [2019-09-10 03:05:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:29,140 INFO L225 Difference]: With dead ends: 172 [2019-09-10 03:05:29,140 INFO L226 Difference]: Without dead ends: 169 [2019-09-10 03:05:29,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 368 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:05:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-10 03:05:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2019-09-10 03:05:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 03:05:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2019-09-10 03:05:29,150 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 191 [2019-09-10 03:05:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:29,151 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2019-09-10 03:05:29,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2019-09-10 03:05:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 03:05:29,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:29,154 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:29,154 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 7 times [2019-09-10 03:05:29,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:29,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:29,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-09-10 03:05:29,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:29,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:29,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:29,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:29,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:29,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:29,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-10 03:05:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-09-10 03:05:30,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:30,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:30,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:30,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-09-10 03:05:31,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:31,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2019-09-10 03:05:31,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:31,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 03:05:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 03:05:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 03:05:31,886 INFO L87 Difference]: Start difference. First operand 143 states and 193 transitions. Second operand 36 states. [2019-09-10 03:05:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:32,441 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2019-09-10 03:05:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 03:05:32,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 177 [2019-09-10 03:05:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:32,446 INFO L225 Difference]: With dead ends: 255 [2019-09-10 03:05:32,446 INFO L226 Difference]: Without dead ends: 240 [2019-09-10 03:05:32,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 344 SyntacticMatches, 28 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=1313, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:05:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-10 03:05:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 151. [2019-09-10 03:05:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-10 03:05:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2019-09-10 03:05:32,467 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 177 [2019-09-10 03:05:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:32,469 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2019-09-10 03:05:32,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 03:05:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2019-09-10 03:05:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 03:05:32,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:32,472 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:32,472 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1006786053, now seen corresponding path program 8 times [2019-09-10 03:05:32,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:32,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:32,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 88 proven. 182 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-10 03:05:32,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:32,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:32,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:32,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:32,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:32,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:32,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:32,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 03:05:32,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:32,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:05:32,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 420 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-10 03:05:32,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 90 proven. 118 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-09-10 03:05:33,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:33,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2019-09-10 03:05:33,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:33,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:33,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:33,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:33,145 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand 13 states. [2019-09-10 03:05:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:33,529 INFO L93 Difference]: Finished difference Result 249 states and 358 transitions. [2019-09-10 03:05:33,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 03:05:33,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 178 [2019-09-10 03:05:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:33,532 INFO L225 Difference]: With dead ends: 249 [2019-09-10 03:05:33,532 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 03:05:33,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:05:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 03:05:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-09-10 03:05:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 03:05:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2019-09-10 03:05:33,543 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 178 [2019-09-10 03:05:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:33,544 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2019-09-10 03:05:33,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2019-09-10 03:05:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:05:33,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:33,547 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 12, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:33,548 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1764276740, now seen corresponding path program 9 times [2019-09-10 03:05:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:33,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:33,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 140 proven. 227 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2019-09-10 03:05:33,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:33,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:33,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:33,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:33,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:33,696 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) [2019-09-10 03:05:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:33,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:33,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:33,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:33,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 03:05:33,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 140 proven. 225 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2019-09-10 03:05:33,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 140 proven. 233 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2019-09-10 03:05:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 20 [2019-09-10 03:05:35,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:35,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:05:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:05:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:05:35,010 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand 14 states. [2019-09-10 03:05:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:35,195 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2019-09-10 03:05:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:05:35,195 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 217 [2019-09-10 03:05:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:35,197 INFO L225 Difference]: With dead ends: 203 [2019-09-10 03:05:35,198 INFO L226 Difference]: Without dead ends: 137 [2019-09-10 03:05:35,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 418 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:05:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-10 03:05:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-09-10 03:05:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 03:05:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2019-09-10 03:05:35,205 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 217 [2019-09-10 03:05:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:35,206 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2019-09-10 03:05:35,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:05:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2019-09-10 03:05:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 03:05:35,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:35,208 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:35,208 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -878668120, now seen corresponding path program 10 times [2019-09-10 03:05:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:35,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:35,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 85 proven. 272 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-09-10 03:05:35,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:35,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:35,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:35,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:35,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:35,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:05:35,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:35,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:35,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 03:05:35,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 89 proven. 266 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-10 03:05:35,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:36,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:36,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:36,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:37,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 87 proven. 282 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:37,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:37,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 16] total 22 [2019-09-10 03:05:37,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:37,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:05:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:05:37,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:05:37,110 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand 15 states. [2019-09-10 03:05:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:37,306 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2019-09-10 03:05:37,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:05:37,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2019-09-10 03:05:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:37,307 INFO L225 Difference]: With dead ends: 168 [2019-09-10 03:05:37,307 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:05:37,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 364 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:05:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:05:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:05:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:05:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:05:37,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2019-09-10 03:05:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:37,309 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:05:37,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:05:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:05:37,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:05:37,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:05:37 BoogieIcfgContainer [2019-09-10 03:05:37,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:05:37,315 INFO L168 Benchmark]: Toolchain (without parser) took 21251.02 ms. Allocated memory was 141.0 MB in the beginning and 553.1 MB in the end (delta: 412.1 MB). Free memory was 88.6 MB in the beginning and 166.7 MB in the end (delta: -78.1 MB). Peak memory consumption was 334.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,316 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.85 ms. Allocated memory is still 141.0 MB. Free memory was 88.4 MB in the beginning and 79.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,318 INFO L168 Benchmark]: Boogie Preprocessor took 143.77 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 79.1 MB in the beginning and 178.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,318 INFO L168 Benchmark]: RCFGBuilder took 295.79 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 165.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,319 INFO L168 Benchmark]: TraceAbstraction took 20483.67 ms. Allocated memory was 200.8 MB in the beginning and 553.1 MB in the end (delta: 352.3 MB). Free memory was 165.1 MB in the beginning and 166.7 MB in the end (delta: -1.6 MB). Peak memory consumption was 350.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:37,323 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.85 ms. Allocated memory is still 141.0 MB. Free memory was 88.4 MB in the beginning and 79.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.77 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 79.1 MB in the beginning and 178.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.79 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 165.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20483.67 ms. Allocated memory was 200.8 MB in the beginning and 553.1 MB in the end (delta: 352.3 MB). Free memory was 165.1 MB in the beginning and 166.7 MB in the end (delta: -1.6 MB). Peak memory consumption was 350.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 20.4s OverallTime, 17 OverallIterations, 19 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 624 SDtfs, 499 SDslu, 4873 SDs, 0 SdLazy, 3065 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4107 GetRequests, 3678 SyntacticMatches, 117 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8613945578231293 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.1836734693877551 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 263 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 3877 NumberOfCodeBlocks, 3581 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 5663 ConstructedInterpolants, 0 QuantifiedInterpolants, 1682110 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3341 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 39 InterpolantComputations, 3 PerfectInterpolantSequences, 21357/25423 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...