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-c6af20d [2019-09-03 20:36:49,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:49,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:49,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:49,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:49,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:49,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:49,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:49,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:49,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:49,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:49,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:49,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:49,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:49,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:49,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:49,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:49,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:49,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:49,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:49,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:49,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:49,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:49,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:49,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:49,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:49,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:49,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:49,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:49,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:49,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:49,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:49,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:49,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:49,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:49,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:49,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:49,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:49,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:49,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:49,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:49,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:36:49,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:49,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:49,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:49,624 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:49,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:49,625 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:49,625 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:49,625 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:49,626 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:49,626 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:49,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:49,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:49,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:49,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:49,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:49,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:49,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:49,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:49,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:49,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:49,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:49,630 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:49,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:49,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:49,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:49,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:49,631 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:49,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:49,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:49,632 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:49,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:49,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:49,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:49,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:49,703 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:49,704 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-03 20:36:49,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ff40f4e/1528a9f4373b4c88920c8c8baa9b6316/FLAG2122e4a0d [2019-09-03 20:36:50,223 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:50,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2019-09-03 20:36:50,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ff40f4e/1528a9f4373b4c88920c8c8baa9b6316/FLAG2122e4a0d [2019-09-03 20:36:50,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ff40f4e/1528a9f4373b4c88920c8c8baa9b6316 [2019-09-03 20:36:50,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:50,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:50,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:50,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:50,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:50,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635b5632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50, skipping insertion in model container [2019-09-03 20:36:50,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:50,668 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:50,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:50,845 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:50,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:50,875 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:50,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50 WrapperNode [2019-09-03 20:36:50,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:50,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:50,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:50,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:50,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (1/1) ... [2019-09-03 20:36:50,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:50,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:50,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:50,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:50,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36: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-03 20:36:51,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:51,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:51,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:36:51,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:51,200 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:51,200 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:51,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:51 BoogieIcfgContainer [2019-09-03 20:36:51,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:51,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:51,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:51,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:51,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:50" (1/3) ... [2019-09-03 20:36:51,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35908a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:51, skipping insertion in model container [2019-09-03 20:36:51,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:50" (2/3) ... [2019-09-03 20:36:51,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35908a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:51, skipping insertion in model container [2019-09-03 20:36:51,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:51" (3/3) ... [2019-09-03 20:36:51,216 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2019-09-03 20:36:51,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:51,240 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:51,285 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:51,345 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:51,345 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:51,346 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:51,346 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:51,346 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:51,346 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:51,346 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:51,346 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 20:36:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:51,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:51,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:51,388 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2019-09-03 20:36:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:51,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:51,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:51,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:36:51,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:51,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:36:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:36:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:51,564 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-03 20:36:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:51,579 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-03 20:36:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:36:51,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:36:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:51,590 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:36:51,590 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:36:51,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:36:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:36:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:36:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:36:51,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:36:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:51,629 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:36:51,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:36:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:36:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:51,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:51,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:51,631 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2019-09-03 20:36:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:51,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:36:51,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:51,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:36:51,782 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 20:36:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:51,866 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-03 20:36:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:36:51,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:36:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:51,868 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:36:51,869 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:36:51,870 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-03 20:36:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:36:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:36:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:36:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-03 20:36:51,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2019-09-03 20:36:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:51,879 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-03 20:36:51,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-03 20:36:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:36:51,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:51,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:51,882 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2019-09-03 20:36:51,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:52,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 20:36:52,144 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2019-09-03 20:36:52,180 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:52,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:52,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:36:52,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:52,378 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-03 20:36:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:52,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,384 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-03 20:36:52,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:36:52,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:52,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,619 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-09-03 20:36:52,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:52,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:36:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:36:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:36:52,835 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2019-09-03 20:36:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,122 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-09-03 20:36:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:36:53,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-09-03 20:36:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,126 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:36:53,126 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:36:53,127 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-03 20:36:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:36:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-09-03 20:36:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:36:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-03 20:36:53,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-09-03 20:36:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,134 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-03 20:36:53,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:36:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-03 20:36:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:36:53,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,135 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,136 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2019-09-03 20:36:53,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,168 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-03 20:36:53,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:53,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:53,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:53,171 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-09-03 20:36:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,195 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-03 20:36:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:53,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-03 20:36:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,199 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:36:53,199 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:36:53,200 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-03 20:36:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:36:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 20:36:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:36:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:36:53,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-03 20:36:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,207 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:36:53,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:36:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:36:53,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,213 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2019-09-03 20:36:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,305 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-03 20:36:53,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:53,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:53,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:53,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:53,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:36:53,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:53,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,404 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-03 20:36:53,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,446 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-03 20:36:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-09-03 20:36:53,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:36:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:36:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:53,454 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-03 20:36:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,493 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-09-03 20:36:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:36:53,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 20:36:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,495 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:36:53,495 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:36:53,496 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-03 20:36:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:36:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 20:36:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:36:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 20:36:53,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2019-09-03 20:36:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,500 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 20:36:53,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:36:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 20:36:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:36:53,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,501 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,502 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2019-09-03 20:36:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,582 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-03 20:36:53,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:53,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:53,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,584 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-03 20:36:53,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:53,616 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-03 20:36:53,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:53,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:53,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,712 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-03 20:36:53,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,777 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-03 20:36:53,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-03 20:36:53,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:36:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:36:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:36:53,783 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-09-03 20:36:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,837 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-09-03 20:36:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:36:53,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-09-03 20:36:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,838 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:36:53,838 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:36:53,839 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-03 20:36:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:36:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 20:36:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:36:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 20:36:53,843 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-09-03 20:36:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,843 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 20:36:53,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:36:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 20:36:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:36:53,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,844 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2019-09-03 20:36:53,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,034 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-03 20:36:54,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:54,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:54,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:54,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:54,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:36:54,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:54,297 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-03 20:36:54,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,627 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-03 20:36:54,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2019-09-03 20:36:54,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:36:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:36:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:36:54,633 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-09-03 20:36:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,166 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-03 20:36:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:36:55,166 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-09-03 20:36:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,168 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:36:55,168 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:36:55,169 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-03 20:36:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:36:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-09-03 20:36:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:36:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-03 20:36:55,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-09-03 20:36:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,174 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-03 20:36:55,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:36:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-03 20:36:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:36:55,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,175 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,175 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2019-09-03 20:36:55,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,241 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-03 20:36:55,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:55,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:55,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:55,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:55,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:36:55,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:55,348 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-03 20:36:55,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:55,435 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-03 20:36:55,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:55,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2019-09-03 20:36:55,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:55,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:36:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:36:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:36:55,439 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2019-09-03 20:36:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,520 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-03 20:36:55,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:36:55,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-09-03 20:36:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,523 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:36:55,523 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:36:55,524 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-03 20:36:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:36:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 20:36:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:36:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-03 20:36:55,530 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2019-09-03 20:36:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,531 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-03 20:36:55,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:36:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-03 20:36:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:36:55,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,532 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,533 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2019-09-03 20:36:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,686 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-03 20:36:55,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:55,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:55,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:55,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,687 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) [2019-09-03 20:36:55,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:55,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:55,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:36:55,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:55,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:36:55,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:55,829 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-03 20:36:55,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:55,892 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-03 20:36:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-03 20:36:55,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:55,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:36:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:36:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:36:55,897 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2019-09-03 20:36:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,969 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-03 20:36:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:36:55,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-03 20:36:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,970 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:36:55,970 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:36:55,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:36:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:36:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-09-03 20:36:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:36:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-03 20:36:55,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2019-09-03 20:36:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,975 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-03 20:36:55,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:36:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-03 20:36:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:36:55,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,976 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,977 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2019-09-03 20:36:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:36:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:36:56,021 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 20:36:56,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:36:56 BoogieIcfgContainer [2019-09-03 20:36:56,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:36:56,060 INFO L168 Benchmark]: Toolchain (without parser) took 5426.35 ms. Allocated memory was 136.8 MB in the beginning and 273.7 MB in the end (delta: 136.8 MB). Free memory was 84.1 MB in the beginning and 156.8 MB in the end (delta: -72.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,061 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 102.8 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.76 ms. Allocated memory is still 136.8 MB. Free memory was 83.9 MB in the beginning and 74.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,065 INFO L168 Benchmark]: Boogie Preprocessor took 107.92 ms. Allocated memory was 136.8 MB in the beginning and 196.6 MB in the end (delta: 59.8 MB). Free memory was 74.9 MB in the beginning and 174.5 MB in the end (delta: -99.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,070 INFO L168 Benchmark]: RCFGBuilder took 223.00 ms. Allocated memory is still 196.6 MB. Free memory was 174.5 MB in the beginning and 162.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,071 INFO L168 Benchmark]: TraceAbstraction took 4848.41 ms. Allocated memory was 196.6 MB in the beginning and 273.7 MB in the end (delta: 77.1 MB). Free memory was 161.8 MB in the beginning and 156.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,081 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 136.8 MB. Free memory was 102.8 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.76 ms. Allocated memory is still 136.8 MB. Free memory was 83.9 MB in the beginning and 74.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.92 ms. Allocated memory was 136.8 MB in the beginning and 196.6 MB in the end (delta: 59.8 MB). Free memory was 74.9 MB in the beginning and 174.5 MB in the end (delta: -99.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 223.00 ms. Allocated memory is still 196.6 MB. Free memory was 174.5 MB in the beginning and 162.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4848.41 ms. Allocated memory was 196.6 MB in the beginning and 273.7 MB in the end (delta: 77.1 MB). Free memory was 161.8 MB in the beginning and 156.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 82.1 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=0, n=6] [L13] COND TRUE i<=n VAL [i=1, j=10, n=6, n=0] [L14] COND TRUE i