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/sum_15x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:10:49,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:10:49,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:10:49,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:10:49,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:10:49,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:10:49,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:10:49,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:10:49,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:10:49,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:10:49,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:10:49,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:10:49,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:10:49,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:10:49,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:10:49,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:10:49,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:10:49,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:10:49,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:10:49,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:10:49,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:10:49,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:10:49,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:10:49,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:10:49,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:10:49,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:10:49,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:10:49,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:10:49,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:10:49,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:10:49,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:10:49,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:10:49,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:10:49,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:10:49,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:10:49,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:10:49,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:10:49,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:10:49,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:10:49,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:10:49,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:10:49,347 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:10:49,374 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:10:49,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:10:49,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:10:49,375 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:10:49,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:10:49,376 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:10:49,376 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:10:49,376 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:10:49,377 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:10:49,377 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:10:49,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:10:49,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:10:49,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:10:49,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:10:49,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:10:49,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:10:49,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:10:49,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:10:49,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:10:49,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:10:49,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:10:49,382 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:10:49,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:10:49,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:10:49,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:10:49,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:10:49,383 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:10:49,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:10:49,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:10:49,383 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:10:49,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:10:49,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:10:49,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:10:49,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:10:49,438 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:10:49,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2019-09-10 03:10:49,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc2947d1/63dfa11391284679a6dfb9a114fac46a/FLAG86c3d5dc8 [2019-09-10 03:10:49,940 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:10:49,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2019-09-10 03:10:49,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc2947d1/63dfa11391284679a6dfb9a114fac46a/FLAG86c3d5dc8 [2019-09-10 03:10:50,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc2947d1/63dfa11391284679a6dfb9a114fac46a [2019-09-10 03:10:50,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:10:50,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:10:50,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:50,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:10:50,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:10:50,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7326b1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50, skipping insertion in model container [2019-09-10 03:10:50,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,354 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:10:50,366 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:10:50,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:50,523 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:10:50,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:50,554 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:10:50,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50 WrapperNode [2019-09-10 03:10:50,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:50,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:10:50,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:10:50,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:10:50,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (1/1) ... [2019-09-10 03:10:50,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:10:50,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:10:50,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:10:50,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:10:50,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (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:10:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:10:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:10:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-09-10 03:10:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:10:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:10:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-09-10 03:10:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:10:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:10:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:10:50,865 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:10:50,866 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:10:50,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:50 BoogieIcfgContainer [2019-09-10 03:10:50,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:10:50,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:10:50,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:10:50,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:10:50,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:10:50" (1/3) ... [2019-09-10 03:10:50,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:50, skipping insertion in model container [2019-09-10 03:10:50,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:50" (2/3) ... [2019-09-10 03:10:50,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:50, skipping insertion in model container [2019-09-10 03:10:50,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:50" (3/3) ... [2019-09-10 03:10:50,880 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2019-09-10 03:10:50,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:10:50,914 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:10:50,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:10:50,991 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:10:50,991 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:10:50,992 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:10:50,992 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:10:50,992 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:10:50,992 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:10:50,992 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:10:50,992 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:10:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:10:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:10:51,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:51,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:51,019 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2019-09-10 03:10:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:51,181 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:10:51,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:10:51,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:10:51,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:10:51,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:10:51,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:10:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:10:51,204 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:10:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:51,302 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-10 03:10:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:10:51,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:10:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:51,311 INFO L225 Difference]: With dead ends: 22 [2019-09-10 03:10:51,311 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:10:51,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:10:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:10:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:10:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:10:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:10:51,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:10:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:51,347 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:10:51,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:10:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:10:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:10:51,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:51,349 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:10:51,349 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2019-09-10 03:10:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:51,421 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:10:51,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:51,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:51,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:10:51,428 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:10:51,462 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:10:51,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:10:51,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:10:51,584 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 2 different actions 4 times. Widened at 1 different actions 4 times. Performed 85 root evaluator evaluations with a maximum evaluation depth of 5. Performed 85 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2019-09-10 03:10:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:51,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:10:51,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:51,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:51,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:51,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:51,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:10:51,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:51,668 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:10:51,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:51,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:10:51,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:51,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-09-10 03:10:51,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:51,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:10:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:10:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:10:51,877 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-10 03:10:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:51,947 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-10 03:10:51,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:10:51,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 03:10:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:51,949 INFO L225 Difference]: With dead ends: 21 [2019-09-10 03:10:51,949 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:10:51,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:10:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:10:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:10:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:10:51,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:10:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:51,956 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:10:51,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:10:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:10:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:10:51,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:51,960 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:10:51,960 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2019-09-10 03:10:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:51,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:52,081 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:10:52,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:52,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:52,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:52,083 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:10:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:52,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:10:52,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:52,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:52,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:10:52,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:52,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:10:52,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:52,170 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:10:52,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:52,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:52,505 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:10:52,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:52,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-09-10 03:10:52,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:52,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:10:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:10:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:52,510 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-09-10 03:10:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:52,578 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-10 03:10:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:10:52,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 03:10:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:52,579 INFO L225 Difference]: With dead ends: 24 [2019-09-10 03:10:52,580 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:10:52,580 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:10:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:10:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:10:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:10:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:10:52,586 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:10:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:52,586 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:10:52,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:10:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:10:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:10:52,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:52,588 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:10:52,588 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2019-09-10 03:10:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:52,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:52,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:52,688 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:10:52,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:52,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:52,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:52,689 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:10:52,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:52,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:10:52,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:52,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:52,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:52,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:52,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:10:52,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:52,762 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:10:52,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:53,308 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:10:53,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:53,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-09-10 03:10:53,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:53,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:10:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:10:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:10:53,313 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-09-10 03:10:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:53,397 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-10 03:10:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:10:53,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-10 03:10:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:53,399 INFO L225 Difference]: With dead ends: 27 [2019-09-10 03:10:53,399 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:10:53,399 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:10:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:10:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:10:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:10:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:10:53,407 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:10:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:53,407 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:10:53,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:10:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:10:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:10:53,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:53,409 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:10:53,409 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2019-09-10 03:10:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:53,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:53,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:53,495 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:10:53,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:53,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:53,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:53,496 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:10:53,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:53,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:53,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:53,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:53,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:10:53,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:53,555 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:10:53,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:54,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:54,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:54,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:54,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:10:54,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:54,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-09-10 03:10:54,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:54,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:10:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:10:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:10:54,321 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-09-10 03:10:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:54,420 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-09-10 03:10:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:10:54,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 03:10:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:54,422 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:10:54,422 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:10:54,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:10:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:10:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:10:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:10:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:10:54,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:10:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:54,428 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:10:54,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:10:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:10:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:10:54,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:54,430 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:10:54,431 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2019-09-10 03:10:54,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:54,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:54,514 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:10:54,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:54,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:54,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:54,515 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:10:54,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:54,515 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:10:54,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:54,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:54,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:10:54,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:54,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 03:10:54,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:54,575 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:10:54,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:55,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:55,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:55,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:55,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:10:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-09-10 03:10:55,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:55,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:10:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:10:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:10:55,856 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-09-10 03:10:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:55,976 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-10 03:10:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:10:55,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-10 03:10:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:55,977 INFO L225 Difference]: With dead ends: 33 [2019-09-10 03:10:55,977 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:10:55,979 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:10:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:10:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:10:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:10:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:10:55,986 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:10:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:55,987 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:10:55,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:10:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:10:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:10:55,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:55,991 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:10:55,991 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2019-09-10 03:10:55,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:55,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:55,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:55,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:56,121 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:10:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:56,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:56,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:56,122 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:10:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:56,123 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:10:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:56,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:10:56,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:56,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:56,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:10:56,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:56,178 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:10:56,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:57,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:58,041 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:10:58,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:58,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-09-10 03:10:58,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:58,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:10:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:10:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:10:58,046 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-09-10 03:10:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:58,191 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-09-10 03:10:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:10:58,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-10 03:10:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:58,192 INFO L225 Difference]: With dead ends: 36 [2019-09-10 03:10:58,193 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:10:58,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:10:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:10:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:10:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:10:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:10:58,199 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:10:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:58,199 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:10:58,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:10:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:10:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:10:58,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:58,201 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:10:58,201 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:58,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2019-09-10 03:10:58,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:58,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:58,368 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:10:58,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:58,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:58,369 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:10:58,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:58,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:58,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:58,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:58,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:10:58,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:58,431 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:10:58,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:59,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:00,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:00,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:01,176 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:11:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-09-10 03:11:01,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:01,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:11:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:11:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:11:01,181 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-09-10 03:11:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:01,363 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-09-10 03:11:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:11:01,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 03:11:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:01,365 INFO L225 Difference]: With dead ends: 39 [2019-09-10 03:11:01,365 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:11:01,366 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:11:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:11:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:11:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:11:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:11:01,372 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:11:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:01,372 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:11:01,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:11:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:11:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:11:01,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:01,374 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:11:01,374 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2019-09-10 03:11:01,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:01,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:01,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:01,477 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:11:01,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:01,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:01,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:01,478 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:11:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:01,478 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:11:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:01,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:11:01,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:11:01,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:01,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:11:01,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:01,555 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:11:01,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:03,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:04,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:04,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:05,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 03:11:05,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:05,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-09-10 03:11:05,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:05,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:11:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:11:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:11:05,457 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-09-10 03:11:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:05,605 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-10 03:11:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:11:05,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 03:11:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:05,607 INFO L225 Difference]: With dead ends: 42 [2019-09-10 03:11:05,607 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:11:05,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:11:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:11:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:11:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:11:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:11:05,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:11:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:05,614 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:11:05,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:11:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:11:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:11:05,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:05,616 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:11:05,616 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2019-09-10 03:11:05,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:05,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:05,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:05,746 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:11:05,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:05,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:05,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:05,747 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:11:05,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:05,748 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:11:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:11:05,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:11:05,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:11:05,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:05,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 03:11:05,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:05,805 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:11:05,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:09,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:10,959 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:11:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:10,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-09-10 03:11:10,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:10,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:11:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:11:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:11:10,965 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2019-09-10 03:11:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:11,143 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-09-10 03:11:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:11:11,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-09-10 03:11:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:11,146 INFO L225 Difference]: With dead ends: 45 [2019-09-10 03:11:11,146 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:11:11,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:11:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:11:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:11:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:11:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:11:11,153 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:11:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:11,153 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:11:11,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:11:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:11:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:11:11,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:11,154 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:11:11,155 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2019-09-10 03:11:11,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:11,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:11,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:11,288 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:11:11,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:11,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:11,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:11,289 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:11:11,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:11,289 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:11:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:11,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:11:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:11:11,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:11,353 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:11:11,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:15,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:16,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:18,259 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:11:18,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:18,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-09-10 03:11:18,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:18,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:11:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:11:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:11:18,267 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2019-09-10 03:11:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:18,420 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-09-10 03:11:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:11:18,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-10 03:11:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:18,422 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:11:18,422 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:11:18,423 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:11:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:11:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 03:11:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:11:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:11:18,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-10 03:11:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:18,430 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:11:18,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:11:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:11:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:11:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:18,431 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:11:18,431 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2019-09-10 03:11:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:18,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:18,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:18,613 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:11:18,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:18,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:18,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:18,614 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:11:18,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:18,614 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:11:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:18,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:18,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:11:18,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:18,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 03:11:18,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:18,731 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:11:18,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:22,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:25,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 03:11:27,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:27,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-09-10 03:11:27,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:27,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:11:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:11:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:11:27,911 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2019-09-10 03:11:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:28,120 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-09-10 03:11:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 03:11:28,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-10 03:11:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:28,122 INFO L225 Difference]: With dead ends: 51 [2019-09-10 03:11:28,122 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:11:28,123 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:11:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:11:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 03:11:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:11:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:11:28,129 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-10 03:11:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:28,130 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:11:28,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:11:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:11:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:11:28,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:28,131 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:11:28,131 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2019-09-10 03:11:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:28,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:28,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:28,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:28,330 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:11:28,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:28,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:28,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:28,331 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:11:28,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:28,332 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:11:28,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:11:28,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:11:28,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:28,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:11:28,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:28,405 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:11:28,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:34,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:38,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:38,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:39,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:40,010 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:11:40,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:40,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-09-10 03:11:40,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:40,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:11:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:11:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:11:40,022 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2019-09-10 03:11:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:40,265 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-09-10 03:11:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:11:40,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 03:11:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:40,267 INFO L225 Difference]: With dead ends: 54 [2019-09-10 03:11:40,268 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:11:40,269 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:11:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:11:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 03:11:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:11:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:11:40,274 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-10 03:11:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:40,275 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:11:40,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:11:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:11:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:11:40,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:40,276 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:11:40,277 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2019-09-10 03:11:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:40,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:11:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:40,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:40,434 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:11:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:40,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:40,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:40,434 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:11:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:40,434 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:11:40,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:40,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:11:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:40,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 03:11:40,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:40,502 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:11:40,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:11:46,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:51,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:52,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:54,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:54,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:54,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:55,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:11:55,140 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:11:55,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:11:55,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-09-10 03:11:55,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:11:55,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:11:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:11:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:11:55,145 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2019-09-10 03:11:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:11:55,395 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-09-10 03:11:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:11:55,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 03:11:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:11:55,397 INFO L225 Difference]: With dead ends: 57 [2019-09-10 03:11:55,397 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:11:55,398 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:11:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:11:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 03:11:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:11:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:11:55,404 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-10 03:11:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:11:55,405 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:11:55,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:11:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:11:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:11:55,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:11:55,406 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:11:55,406 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:11:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:11:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2019-09-10 03:11:55,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:11:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:11:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:11:55,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:11:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:11:55,618 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:11:55,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:55,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:11:55,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:11:55,619 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:11:55,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:11:55,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:11:55,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:11:55,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:11:55,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:11:55,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:55,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:11:55,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:55,737 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:11:55,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:02,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:04,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:06,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:08,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:09,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:11,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:11,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:12,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:12,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:12:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-10 03:12:13,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:13,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2019-09-10 03:12:13,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:13,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:12:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:12:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:12:13,754 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-09-10 03:12:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:14,032 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-10 03:12:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:12:14,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-09-10 03:12:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:14,033 INFO L225 Difference]: With dead ends: 60 [2019-09-10 03:12:14,033 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:12:14,034 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:12:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:12:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 03:12:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:12:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:12:14,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-10 03:12:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:14,046 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:12:14,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:12:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:12:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:12:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:14,048 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:12:14,048 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2019-09-10 03:12:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:14,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:12:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:14,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:12:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:12:14,129 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:12:14,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:12:14 BoogieIcfgContainer [2019-09-10 03:12:14,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:12:14,199 INFO L168 Benchmark]: Toolchain (without parser) took 83859.23 ms. Allocated memory was 133.7 MB in the beginning and 656.4 MB in the end (delta: 522.7 MB). Free memory was 88.9 MB in the beginning and 285.7 MB in the end (delta: -196.8 MB). Peak memory consumption was 325.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:12:14,200 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 106.8 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:12:14,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.24 ms. Allocated memory is still 133.7 MB. Free memory was 88.5 MB in the beginning and 79.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:12:14,202 INFO L168 Benchmark]: Boogie Preprocessor took 110.50 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 79.7 MB in the beginning and 177.4 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:12:14,206 INFO L168 Benchmark]: RCFGBuilder took 205.30 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 165.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:12:14,207 INFO L168 Benchmark]: TraceAbstraction took 83320.93 ms. Allocated memory was 199.8 MB in the beginning and 656.4 MB in the end (delta: 456.7 MB). Free memory was 165.7 MB in the beginning and 285.7 MB in the end (delta: -119.9 MB). Peak memory consumption was 336.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:12:14,219 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 216.24 ms. Allocated memory is still 133.7 MB. Free memory was 88.5 MB in the beginning and 79.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.50 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 79.7 MB in the beginning and 177.4 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 205.30 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 165.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83320.93 ms. Allocated memory was 199.8 MB in the beginning and 656.4 MB in the end (delta: 456.7 MB). Free memory was 165.7 MB in the beginning and 285.7 MB in the end (delta: -119.9 MB). Peak memory consumption was 336.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 83.2s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 318 SDslu, 1159 SDs, 0 SdLazy, 906 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2015 GetRequests, 1374 SyntacticMatches, 239 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3554 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 79.0s InterpolantComputationTime, 1740 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 2406 ConstructedInterpolants, 0 QuantifiedInterpolants, 462912 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2408 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...