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/id_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:06:27,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:06:27,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:06:27,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:06:27,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:06:27,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:06:27,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:06:27,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:06:27,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:06:27,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:06:27,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:06:27,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:06:27,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:06:27,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:06:27,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:06:27,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:06:27,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:06:27,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:06:27,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:06:27,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:06:27,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:06:27,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:06:27,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:06:27,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:06:27,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:06:27,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:06:27,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:06:27,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:06:27,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:06:27,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:06:27,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:06:27,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:06:27,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:06:27,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:06:27,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:06:27,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:06:27,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:06:27,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:06:27,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:06:27,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:06:27,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:06:27,107 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:06:27,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:06:27,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:06:27,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:06:27,132 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:06:27,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:06:27,133 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:06:27,133 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:06:27,133 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:06:27,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:06:27,134 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:06:27,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:06:27,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:06:27,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:06:27,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:06:27,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:06:27,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:06:27,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:06:27,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:06:27,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:06:27,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:06:27,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:06:27,139 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:06:27,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:06:27,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:06:27,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:06:27,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:06:27,140 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:06:27,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:06:27,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:06:27,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:06:27,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:06:27,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:06:27,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:06:27,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:06:27,224 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:06:27,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2019-09-10 03:06:27,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c95bfbb/56a2a788781c4a239fddb4dfe0df38f8/FLAGb1d2d9cdc [2019-09-10 03:06:27,775 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:06:27,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2019-09-10 03:06:27,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c95bfbb/56a2a788781c4a239fddb4dfe0df38f8/FLAGb1d2d9cdc [2019-09-10 03:06:28,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c95bfbb/56a2a788781c4a239fddb4dfe0df38f8 [2019-09-10 03:06:28,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:06:28,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:06:28,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:28,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:06:28,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:06:28,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b74f5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28, skipping insertion in model container [2019-09-10 03:06:28,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,154 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:06:28,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:06:28,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:28,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:06:28,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:28,433 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:06:28,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28 WrapperNode [2019-09-10 03:06:28,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:28,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:06:28,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:06:28,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:06:28,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (1/1) ... [2019-09-10 03:06:28,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:06:28,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:06:28,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:06:28,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:06:28,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (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:06:28,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:06:28,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:06:28,649 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:06:28,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:06:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:06:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:06:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:06:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:06:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:06:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:06:28,812 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:06:28,812 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:06:28,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:28 BoogieIcfgContainer [2019-09-10 03:06:28,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:06:28,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:06:28,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:06:28,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:06:28,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:06:28" (1/3) ... [2019-09-10 03:06:28,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952bf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:28, skipping insertion in model container [2019-09-10 03:06:28,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:28" (2/3) ... [2019-09-10 03:06:28,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952bf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:28, skipping insertion in model container [2019-09-10 03:06:28,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:28" (3/3) ... [2019-09-10 03:06:28,825 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2019-09-10 03:06:28,835 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:06:28,845 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:06:28,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:06:28,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:06:28,888 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:06:28,890 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:06:28,890 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:06:28,891 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:06:28,891 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:06:28,891 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:06:28,891 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:06:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:06:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:06:28,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:28,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:28,915 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-10 03:06:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:28,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:29,145 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:06:29,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:29,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:29,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:29,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:29,184 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:06:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:29,267 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-10 03:06:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:29,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:06:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:29,280 INFO L225 Difference]: With dead ends: 22 [2019-09-10 03:06:29,281 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:06:29,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:06:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:06:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:06:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:06:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:06:29,327 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:06:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:29,327 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:06:29,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:06:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:06:29,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:29,329 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:29,330 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-10 03:06:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:29,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:29,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:29,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:29,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:29,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:06:29,423 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:06:29,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:29,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:29,625 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:06:29,629 INFO L272 AbstractInterpreter]: Visited 16 different actions 104 times. Merged at 5 different actions 41 times. Widened at 1 different actions 4 times. Performed 155 root evaluator evaluations with a maximum evaluation depth of 3. Performed 155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:06:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:29,633 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:06:29,685 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 58.33% of their original sizes. [2019-09-10 03:06:29,685 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:06:29,833 INFO L420 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2019-09-10 03:06:29,833 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:06:29,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:06:29,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2019-09-10 03:06:29,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:29,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:06:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:06:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:06:29,837 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2019-09-10 03:06:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:30,233 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-10 03:06:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:06:30,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-09-10 03:06:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:30,236 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:06:30,236 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:06:30,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:06:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-09-10 03:06:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 03:06:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-10 03:06:30,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2019-09-10 03:06:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:30,251 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-10 03:06:30,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:06:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-10 03:06:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:06:30,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:30,257 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:30,257 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-10 03:06:30,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:30,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:06:30,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:30,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:30,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:30,392 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:06:30,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:30,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:06:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:30,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:30,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:06:30,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:30,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:06:30,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:06:30,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 03:06:30,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-09-10 03:06:30,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:30,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:06:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:06:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:06:30,858 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-09-10 03:06:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:30,939 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-09-10 03:06:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:06:30,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 03:06:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:30,943 INFO L225 Difference]: With dead ends: 45 [2019-09-10 03:06:30,943 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:06:30,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:06:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-09-10 03:06:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:06:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:06:30,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-09-10 03:06:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:30,952 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:06:30,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:06:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:06:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:06:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:30,953 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:30,954 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-10 03:06:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:30,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:31,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:31,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:31,039 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:06:31,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,040 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:06:31,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:31,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:31,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:31,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:31,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:06:31,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:31,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:06:31,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-09-10 03:06:31,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:31,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:06:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:06:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:06:31,669 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 8 states. [2019-09-10 03:06:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:31,766 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-09-10 03:06:31,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:06:31,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-10 03:06:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:31,768 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:06:31,768 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:06:31,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:06:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:06:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-09-10 03:06:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:06:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:06:31,776 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-09-10 03:06:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:31,776 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:06:31,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:06:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:06:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:06:31,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:31,778 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:31,779 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-10 03:06:31,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:31,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:31,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:06:31,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:31,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:31,877 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:06:31,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:31,877 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:06:31,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:31,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:31,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:06:31,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:06:31,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:06:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:32,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-09-10 03:06:32,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:32,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:06:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:06:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:32,758 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2019-09-10 03:06:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:32,850 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-09-10 03:06:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:06:32,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 03:06:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:32,852 INFO L225 Difference]: With dead ends: 51 [2019-09-10 03:06:32,852 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:06:32,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:06:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:06:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2019-09-10 03:06:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:06:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:06:32,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 37 [2019-09-10 03:06:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:32,860 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:06:32,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:06:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:06:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:06:32,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:32,861 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:32,862 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-10 03:06:32,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:32,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:32,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:06:32,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:32,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:32,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:32,977 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:06:32,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:32,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:06:32,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:32,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:33,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:06:33,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:33,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 03:06:33,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:06:33,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:34,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:34,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:06:34,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-09-10 03:06:34,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:34,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:06:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:06:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:06:34,289 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 10 states. [2019-09-10 03:06:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:34,394 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-09-10 03:06:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:06:34,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-10 03:06:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:34,396 INFO L225 Difference]: With dead ends: 54 [2019-09-10 03:06:34,396 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:06:34,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:06:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:06:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2019-09-10 03:06:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:06:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:06:34,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 43 [2019-09-10 03:06:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:34,405 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:06:34,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:06:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:06:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:06:34,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:34,407 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:34,407 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-10 03:06:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:34,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:34,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:06:34,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:34,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:34,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:34,503 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:06:34,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:34,504 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:06:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:34,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:34,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:34,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:34,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:06:34,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:06:34,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:06:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-09-10 03:06:36,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:36,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:06:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:06:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:06:36,589 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-10 03:06:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:36,790 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-09-10 03:06:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:06:36,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-10 03:06:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:36,792 INFO L225 Difference]: With dead ends: 57 [2019-09-10 03:06:36,792 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:06:36,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:06:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:06:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-09-10 03:06:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:06:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:06:36,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 49 [2019-09-10 03:06:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:36,800 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:06:36,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:06:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:06:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:06:36,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:36,802 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:36,802 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-10 03:06:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:36,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:36,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:06:36,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:36,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:36,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:36,966 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:06:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:36,966 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:06:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:36,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:36,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:06:36,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:06:37,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:06:39,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-09-10 03:06:39,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:39,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:06:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:06:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:06:39,860 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2019-09-10 03:06:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:39,997 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-10 03:06:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:06:39,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 03:06:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:40,000 INFO L225 Difference]: With dead ends: 60 [2019-09-10 03:06:40,001 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:06:40,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:06:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:06:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-09-10 03:06:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:06:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:06:40,008 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 55 [2019-09-10 03:06:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:40,008 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:06:40,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:06:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:06:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:06:40,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:40,010 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:40,010 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-10 03:06:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:40,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:06:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:40,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:40,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:40,142 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:06:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:40,143 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:06:40,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:40,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:40,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:06:40,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:40,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:06:40,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:06:40,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:06:43,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:43,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 46 [2019-09-10 03:06:43,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:43,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 03:06:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 03:06:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1747, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:06:43,516 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 32 states. [2019-09-10 03:06:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:43,982 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-09-10 03:06:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:06:43,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-09-10 03:06:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:43,985 INFO L225 Difference]: With dead ends: 63 [2019-09-10 03:06:43,985 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:06:43,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=702, Invalid=3204, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 03:06:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:06:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-09-10 03:06:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:06:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:06:43,993 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 61 [2019-09-10 03:06:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:43,993 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:06:43,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 03:06:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:06:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:06:43,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:43,995 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:43,995 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-10 03:06:43,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:43,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:43,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:06:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:44,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:44,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:44,121 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:06:44,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:44,121 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:06:44,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:44,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:44,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:44,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:44,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 03:06:44,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:06:44,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:47,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 03:06:49,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:49,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-09-10 03:06:49,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:49,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:06:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:06:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:06:49,667 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 14 states. [2019-09-10 03:06:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:49,861 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-09-10 03:06:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:06:49,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-09-10 03:06:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:49,864 INFO L225 Difference]: With dead ends: 66 [2019-09-10 03:06:49,864 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:06:49,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:06:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:06:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2019-09-10 03:06:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:06:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:06:49,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 67 [2019-09-10 03:06:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:49,873 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:06:49,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:06:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:06:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:06:49,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:49,875 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:49,876 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-10 03:06:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:49,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:49,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:06:50,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:50,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:50,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:50,047 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:06:50,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:50,047 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:06:50,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:50,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:50,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:06:50,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:06:50,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:54,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:56,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 03:06:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:57,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-09-10 03:06:57,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:57,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:06:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:06:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:06:57,316 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 15 states. [2019-09-10 03:06:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:57,519 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-09-10 03:06:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:06:57,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-10 03:06:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:57,521 INFO L225 Difference]: With dead ends: 69 [2019-09-10 03:06:57,521 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 03:06:57,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:06:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 03:06:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-09-10 03:06:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:06:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:06:57,529 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 73 [2019-09-10 03:06:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:57,529 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:06:57,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:06:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:06:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:06:57,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:57,531 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:57,531 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:57,532 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2019-09-10 03:06:57,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:57,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:57,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:57,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:57,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:06:57,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:57,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:57,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:57,679 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:06:57,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:57,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:57,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:57,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:06:57,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:57,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 03:06:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:06:57,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:01,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:04,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:05,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:06,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:07,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:07:07,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:07,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-09-10 03:07:07,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:07,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:07:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:07:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:07:07,310 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 16 states. [2019-09-10 03:07:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:07,578 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-09-10 03:07:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 03:07:07,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-10 03:07:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:07,579 INFO L225 Difference]: With dead ends: 72 [2019-09-10 03:07:07,579 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 03:07:07,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:07:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 03:07:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-09-10 03:07:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:07:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:07:07,597 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 79 [2019-09-10 03:07:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:07,598 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:07:07,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:07:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:07:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:07:07,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:07,605 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:07,605 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2019-09-10 03:07:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:07,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:07,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:07:07,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:07,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:07,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:07,889 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:07:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:07,889 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:07:07,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:07:07,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:07,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:07:07,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:07:07,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:07:07,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:07:07,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:12,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:19,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:19,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:20,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 03:07:20,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:20,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-09-10 03:07:20,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:20,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:07:20,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:07:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:07:20,124 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2019-09-10 03:07:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:20,364 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-09-10 03:07:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:07:20,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 03:07:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:20,366 INFO L225 Difference]: With dead ends: 75 [2019-09-10 03:07:20,367 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 03:07:20,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:07:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 03:07:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-09-10 03:07:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:07:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:07:20,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 85 [2019-09-10 03:07:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:20,376 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:07:20,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:07:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:07:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:07:20,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:20,377 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:20,377 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2019-09-10 03:07:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:20,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:20,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:07:20,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:20,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:20,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:20,581 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:07:20,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:20,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:07:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:07:20,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:20,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 03:07:20,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:07:20,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:26,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:34,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-10 03:07:35,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:35,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-09-10 03:07:35,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:35,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:07:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:07:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:07:35,995 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 18 states. [2019-09-10 03:07:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:36,251 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-09-10 03:07:36,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:07:36,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 03:07:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:36,253 INFO L225 Difference]: With dead ends: 78 [2019-09-10 03:07:36,253 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 03:07:36,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:07:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 03:07:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-09-10 03:07:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 03:07:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-10 03:07:36,261 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 91 [2019-09-10 03:07:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:36,262 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-10 03:07:36,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:07:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-10 03:07:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:07:36,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:36,263 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:36,264 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2019-09-10 03:07:36,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:07:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:36,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:07:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:07:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:36,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:07:36,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:07:36,449 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:07:36,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:07:36,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:07:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:07:36,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:07:36,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:07:36,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:07:36,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:07:36,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:07:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:07:36,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:07:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:46,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:51,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:53,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:54,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:07:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-10 03:07:55,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:07:55,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2019-09-10 03:07:55,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:07:55,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:07:55,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:07:55,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:07:55,599 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 19 states. [2019-09-10 03:07:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:07:55,873 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-09-10 03:07:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:07:55,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-09-10 03:07:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:07:55,874 INFO L225 Difference]: With dead ends: 81 [2019-09-10 03:07:55,874 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 03:07:55,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 31 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=800, Invalid=1552, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:07:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 03:07:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2019-09-10 03:07:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 03:07:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 03:07:55,881 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 97 [2019-09-10 03:07:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:07:55,882 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 03:07:55,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:07:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 03:07:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:07:55,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:07:55,883 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:07:55,884 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:07:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:07:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2019-09-10 03:07:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:07:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:55,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:07:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:07:55,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:07:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:07:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:07:55,945 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:07:55,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:07:55 BoogieIcfgContainer [2019-09-10 03:07:55,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:07:56,002 INFO L168 Benchmark]: Toolchain (without parser) took 87861.48 ms. Allocated memory was 133.2 MB in the beginning and 656.9 MB in the end (delta: 523.8 MB). Free memory was 90.0 MB in the beginning and 164.8 MB in the end (delta: -74.8 MB). Peak memory consumption was 449.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:07:56,003 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 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:07:56,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.72 ms. Allocated memory is still 133.2 MB. Free memory was 89.8 MB in the beginning and 80.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:07:56,006 INFO L168 Benchmark]: Boogie Preprocessor took 134.01 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 80.3 MB in the beginning and 177.9 MB in the end (delta: -97.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:07:56,007 INFO L168 Benchmark]: RCFGBuilder took 244.32 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:07:56,009 INFO L168 Benchmark]: TraceAbstraction took 87180.88 ms. Allocated memory was 200.3 MB in the beginning and 656.9 MB in the end (delta: 456.7 MB). Free memory was 166.1 MB in the beginning and 164.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:07:56,018 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.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.72 ms. Allocated memory is still 133.2 MB. Free memory was 89.8 MB in the beginning and 80.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.01 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 80.3 MB in the beginning and 177.9 MB in the end (delta: -97.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 244.32 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87180.88 ms. Allocated memory was 200.3 MB in the beginning and 656.9 MB in the end (delta: 456.7 MB). Free memory was 166.1 MB in the beginning and 164.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; VAL [input=15] [L11] CALL, EXPR id(input) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 87.1s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 317 SDslu, 1581 SDs, 0 SdLazy, 916 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1997 GetRequests, 1339 SyntacticMatches, 222 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4229 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.6944444444444444 AbsIntWeakeningRatio, 0.5555555555555556 AbsIntAvgWeakeningVarsNumRemoved, 0.16666666666666666 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 119 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 82.0s InterpolantComputationTime, 1721 NumberOfCodeBlocks, 1721 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2370 ConstructedInterpolants, 0 QuantifiedInterpolants, 453480 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1872 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 41 InterpolantComputations, 1 PerfectInterpolantSequences, 3771/9442 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...