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/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:49:07,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:49:07,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:49:07,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:49:07,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:49:07,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:49:07,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:49:07,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:49:07,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:49:07,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:49:07,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:49:07,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:49:07,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:49:07,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:49:07,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:49:07,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:49:07,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:49:07,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:49:07,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:49:07,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:49:07,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:49:07,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:49:07,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:49:07,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:49:07,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:49:07,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:49:07,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:49:07,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:49:07,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:49:07,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:49:07,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:49:07,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:49:07,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:49:07,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:49:07,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:49:07,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:49:07,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:49:07,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:49:07,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:49:07,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:49:07,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:49:07,615 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 01:49:07,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:49:07,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:49:07,630 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:49:07,630 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:49:07,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:49:07,631 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:49:07,631 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:49:07,632 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:49:07,632 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:49:07,632 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:49:07,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:49:07,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:49:07,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:49:07,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:49:07,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:49:07,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:49:07,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:49:07,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:49:07,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:49:07,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:49:07,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:49:07,635 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:49:07,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:49:07,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:49:07,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:49:07,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:49:07,636 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:49:07,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:49:07,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:49:07,636 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:49:07,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:49:07,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:49:07,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:49:07,690 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:49:07,691 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:49:07,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2019-09-10 01:49:07,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f0050d4/0948410486ec4a14a4ca50f456240b95/FLAG0155367fb [2019-09-10 01:49:08,215 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:49:08,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2019-09-10 01:49:08,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f0050d4/0948410486ec4a14a4ca50f456240b95/FLAG0155367fb [2019-09-10 01:49:08,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f0050d4/0948410486ec4a14a4ca50f456240b95 [2019-09-10 01:49:08,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:49:08,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:49:08,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:08,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:49:08,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:49:08,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:08,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7472fefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08, skipping insertion in model container [2019-09-10 01:49:08,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:08,639 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:49:08,653 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:49:08,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:08,878 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:49:08,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:08,916 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:49:08,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08 WrapperNode [2019-09-10 01:49:08,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:08,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:49:08,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:49:08,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:49:09,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (1/1) ... [2019-09-10 01:49:09,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:49:09,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:49:09,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:49:09,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:49:09,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (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 01:49:09,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:49:09,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:49:09,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:49:09,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:49:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:49:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:49:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 01:49:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:49:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:49:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:49:09,320 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:49:09,320 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:49:09,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:09 BoogieIcfgContainer [2019-09-10 01:49:09,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:49:09,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:49:09,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:49:09,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:49:09,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:49:08" (1/3) ... [2019-09-10 01:49:09,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf4c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:09, skipping insertion in model container [2019-09-10 01:49:09,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:08" (2/3) ... [2019-09-10 01:49:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf4c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:09, skipping insertion in model container [2019-09-10 01:49:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:09" (3/3) ... [2019-09-10 01:49:09,347 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2019-09-10 01:49:09,358 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:49:09,365 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:49:09,393 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:49:09,432 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:49:09,433 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:49:09,433 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:49:09,433 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:49:09,433 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:49:09,433 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:49:09,433 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:49:09,433 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:49:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 01:49:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:49:09,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:09,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:09,460 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2019-09-10 01:49:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:09,564 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 01:49:09,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:09,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:49:09,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:09,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:49:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:49:09,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:49:09,582 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-10 01:49:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:09,594 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-10 01:49:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:49:09,596 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 01:49:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:09,605 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:49:09,605 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:49:09,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:49:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:49:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:49:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:49:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 01:49:09,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 01:49:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:09,640 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 01:49:09,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:49:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 01:49:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:49:09,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:09,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:09,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:09,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2019-09-10 01:49:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:09,745 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 01:49:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:49:09,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:09,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:49:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:49:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:49:09,749 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-10 01:49:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:09,809 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-10 01:49:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:49:09,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-10 01:49:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:09,811 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:49:09,811 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:49:09,812 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 01:49:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:49:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:49:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:49:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-10 01:49:09,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2019-09-10 01:49:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:09,817 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-10 01:49:09,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:49:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-10 01:49:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:49:09,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:09,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:09,819 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2019-09-10 01:49:09,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:09,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:10,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:10,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:10,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-10 01:49:10,036 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2019-09-10 01:49:10,070 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:49:10,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:49:10,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:49:10,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:49:10,282 INFO L272 AbstractInterpreter]: Visited 14 different actions 68 times. Merged at 5 different actions 30 times. Widened at 1 different actions 4 times. Performed 117 root evaluator evaluations with a maximum evaluation depth of 6. Performed 117 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-09-10 01:49:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:10,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:49:10,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:10,287 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 01:49:10,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:10,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:10,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 01:49:10,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:10,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:10,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:10,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:10,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-09-10 01:49:10,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:10,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:49:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:49:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:49:10,740 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2019-09-10 01:49:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:11,016 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-09-10 01:49:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:49:11,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-09-10 01:49:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:11,019 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:49:11,020 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:49:11,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:49:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:49:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-09-10 01:49:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:49:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 01:49:11,026 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-09-10 01:49:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:11,026 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 01:49:11,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:49:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 01:49:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:49:11,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:11,028 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:11,028 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2019-09-10 01:49:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:11,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:49:11,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:11,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:49:11,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:11,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:49:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:49:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:49:11,065 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-09-10 01:49:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:11,078 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-10 01:49:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:49:11,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-10 01:49:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:11,079 INFO L225 Difference]: With dead ends: 23 [2019-09-10 01:49:11,079 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:49:11,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:49:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:49:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:49:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:49:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-10 01:49:11,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-10 01:49:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:11,084 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-10 01:49:11,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:49:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-10 01:49:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:49:11,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:11,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:11,085 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2019-09-10 01:49:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:11,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:11,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:11,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:11,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:11,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:11,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:49:11,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:11,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:49:11,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:11,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-09-10 01:49:11,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:11,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:49:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:49:11,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:49:11,276 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-10 01:49:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:11,311 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-09-10 01:49:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:49:11,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-10 01:49:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:11,313 INFO L225 Difference]: With dead ends: 23 [2019-09-10 01:49:11,313 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:49:11,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:49:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:49:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:49:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:49:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-10 01:49:11,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2019-09-10 01:49:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:11,319 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-10 01:49:11,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:49:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-10 01:49:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:49:11,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:11,320 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:11,320 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2019-09-10 01:49:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:11,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:11,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:11,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:11,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:11,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:11,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:11,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:49:11,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:11,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:11,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-10 01:49:11,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:11,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:49:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:49:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:49:11,584 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-09-10 01:49:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:11,641 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-09-10 01:49:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:49:11,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-09-10 01:49:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:11,643 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:49:11,643 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:49:11,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:49:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:49:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-10 01:49:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:49:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 01:49:11,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-09-10 01:49:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 01:49:11,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:49:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 01:49:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:49:11,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:11,651 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:11,652 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2019-09-10 01:49:11,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:11,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 01:49:11,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:11,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:11,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:11,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:11,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:49:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:11,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:11,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:49:11,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:11,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 01:49:11,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:12,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:12,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:12,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:12,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2019-09-10 01:49:12,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:12,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:49:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:49:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:49:12,456 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-09-10 01:49:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:12,965 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-10 01:49:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:49:12,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-09-10 01:49:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:12,966 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:49:12,966 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:49:12,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 01:49:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:49:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-09-10 01:49:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:49:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-10 01:49:12,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-09-10 01:49:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:12,972 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-10 01:49:12,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:49:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-10 01:49:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:49:12,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:12,973 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:12,973 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2019-09-10 01:49:12,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:12,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:12,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:12,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:12,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:13,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:13,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:13,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:13,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:13,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:49:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:13,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:13,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:49:13,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:13,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2019-09-10 01:49:13,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:13,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:49:13,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:49:13,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:49:13,197 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2019-09-10 01:49:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:13,273 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-10 01:49:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:49:13,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-09-10 01:49:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:13,276 INFO L225 Difference]: With dead ends: 33 [2019-09-10 01:49:13,277 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:49:13,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:49:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:49:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-10 01:49:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:49:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-10 01:49:13,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2019-09-10 01:49:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:13,281 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-10 01:49:13,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:49:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-10 01:49:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:49:13,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:13,282 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:13,282 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2019-09-10 01:49:13,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:13,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:13,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:13,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:13,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:13,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:13,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:13,362 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 01:49:13,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:13,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:13,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:49:13,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:13,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:49:13,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:13,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-10 01:49:13,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:13,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 01:49:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 01:49:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:49:13,570 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2019-09-10 01:49:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:13,652 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-10 01:49:13,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:49:13,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-10 01:49:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:13,653 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:49:13,653 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:49:13,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:49:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:49:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-09-10 01:49:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:49:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-10 01:49:13,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2019-09-10 01:49:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:13,658 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-10 01:49:13,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 01:49:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-10 01:49:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:49:13,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:13,659 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:13,659 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2019-09-10 01:49:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:13,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:13,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:49:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:49:13,700 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:49:13,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:49:13 BoogieIcfgContainer [2019-09-10 01:49:13,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:49:13,730 INFO L168 Benchmark]: Toolchain (without parser) took 5106.69 ms. Allocated memory was 134.2 MB in the beginning and 254.8 MB in the end (delta: 120.6 MB). Free memory was 90.2 MB in the beginning and 97.9 MB in the end (delta: -7.7 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,731 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.66 ms. Allocated memory is still 134.2 MB. Free memory was 90.0 MB in the beginning and 81.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,732 INFO L168 Benchmark]: Boogie Preprocessor took 152.50 ms. Allocated memory was 134.2 MB in the beginning and 203.4 MB in the end (delta: 69.2 MB). Free memory was 80.8 MB in the beginning and 180.4 MB in the end (delta: -99.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,733 INFO L168 Benchmark]: RCFGBuilder took 252.07 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 168.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,734 INFO L168 Benchmark]: TraceAbstraction took 4403.45 ms. Allocated memory was 203.4 MB in the beginning and 254.8 MB in the end (delta: 51.4 MB). Free memory was 168.3 MB in the beginning and 97.9 MB in the end (delta: 70.4 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:49:13,738 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.19 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.66 ms. Allocated memory is still 134.2 MB. Free memory was 90.0 MB in the beginning and 81.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.50 ms. Allocated memory was 134.2 MB in the beginning and 203.4 MB in the end (delta: 69.2 MB). Free memory was 80.8 MB in the beginning and 180.4 MB in the end (delta: -99.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 252.07 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 168.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4403.45 ms. Allocated memory was 203.4 MB in the beginning and 254.8 MB in the end (delta: 51.4 MB). Free memory was 168.3 MB in the beginning and 97.9 MB in the end (delta: 70.4 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i