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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:07:12,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:07:12,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:07:12,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:07:12,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:07:12,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:07:12,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:07:12,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:07:12,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:07:12,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:07:12,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:07:12,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:07:12,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:07:12,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:07:12,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:07:12,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:07:12,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:07:12,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:07:12,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:07:12,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:07:12,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:07:12,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:07:12,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:07:12,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:07:12,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:07:12,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:07:12,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:07:12,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:07:12,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:07:12,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:07:12,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:07:12,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:07:12,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:07:12,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:07:12,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:07:12,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:07:12,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:07:12,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:07:12,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:07:12,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:07:12,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:07:12,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:07:12,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:07:12,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:07:12,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:07:12,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:07:12,808 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:07:12,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:07:12,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:07:12,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:07:12,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:07:12,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:07:12,810 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:07:12,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:07:12,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:07:12,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:07:12,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:07:12,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:07:12,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:07:12,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:07:12,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:07:12,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:07:12,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:07:12,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:07:12,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:07:12,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:07:13,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:07:13,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:07:13,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:07:13,110 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:07:13,110 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:07:13,111 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2019-10-13 21:07:13,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba4e6b24/c8790b8d9b2947b8901314eb7f1912da/FLAG7c17c7453 [2019-10-13 21:07:13,653 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:07:13,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2019-10-13 21:07:13,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba4e6b24/c8790b8d9b2947b8901314eb7f1912da/FLAG7c17c7453 [2019-10-13 21:07:14,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba4e6b24/c8790b8d9b2947b8901314eb7f1912da [2019-10-13 21:07:14,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:07:14,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:07:14,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:07:14,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:07:14,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:07:14,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2e6592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14, skipping insertion in model container [2019-10-13 21:07:14,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:07:14,125 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:07:14,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:07:14,311 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:07:14,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:07:14,336 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:07:14,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14 WrapperNode [2019-10-13 21:07:14,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:07:14,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:07:14,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:07:14,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:07:14,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (1/1) ... [2019-10-13 21:07:14,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:07:14,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:07:14,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:07:14,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:07:14,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (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-10-13 21:07:14,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:07:14,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:07:14,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:07:14,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:07:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:07:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:07:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 21:07:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:07:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:07:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:07:14,662 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:07:14,662 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:07:14,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:14 BoogieIcfgContainer [2019-10-13 21:07:14,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:07:14,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:07:14,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:07:14,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:07:14,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:07:14" (1/3) ... [2019-10-13 21:07:14,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773a62d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:14, skipping insertion in model container [2019-10-13 21:07:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:14" (2/3) ... [2019-10-13 21:07:14,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773a62d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:14, skipping insertion in model container [2019-10-13 21:07:14,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:14" (3/3) ... [2019-10-13 21:07:14,674 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2019-10-13 21:07:14,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:07:14,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:07:14,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:07:14,745 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:07:14,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:07:14,746 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:07:14,746 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:07:14,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:07:14,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:07:14,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:07:14,747 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:07:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:07:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:07:14,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:14,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:14,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2019-10-13 21:07:14,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:14,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994146797] [2019-10-13 21:07:14,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:14,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:14,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:14,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994146797] [2019-10-13 21:07:14,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:14,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:07:14,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319675520] [2019-10-13 21:07:14,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:07:14,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:07:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:07:14,934 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-13 21:07:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:14,956 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-13 21:07:14,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:07:14,957 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 21:07:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:14,965 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:07:14,965 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 21:07:14,969 INFO L600 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-10-13 21:07:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 21:07:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-13 21:07:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 21:07:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 21:07:15,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-10-13 21:07:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:15,003 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 21:07:15,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:07:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 21:07:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:07:15,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:15,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:15,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2019-10-13 21:07:15,006 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:15,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626888035] [2019-10-13 21:07:15,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:15,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:15,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:15,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626888035] [2019-10-13 21:07:15,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:15,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:07:15,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81227435] [2019-10-13 21:07:15,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:07:15,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:15,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:07:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:07:15,100 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-13 21:07:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:15,172 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-10-13 21:07:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:07:15,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-13 21:07:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:15,173 INFO L225 Difference]: With dead ends: 23 [2019-10-13 21:07:15,174 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:07:15,175 INFO L600 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-10-13 21:07:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:07:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:07:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:07:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:07:15,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2019-10-13 21:07:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:15,180 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:07:15,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:07:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:07:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:07:15,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:15,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:15,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2019-10-13 21:07:15,183 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:15,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712941628] [2019-10-13 21:07:15,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:15,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:15,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:15,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712941628] [2019-10-13 21:07:15,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459292060] [2019-10-13 21:07:15,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:15,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:07:15,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:07:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:07:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:15,707 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:07:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:15,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [960129537] [2019-10-13 21:07:15,894 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 15 [2019-10-13 21:07:15,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:07:15,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:07:15,999 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:07:16,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:07:16,147 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-10-13 21:07:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:16,152 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:07:16,153 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:07:16,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-10-13 21:07:16,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392237057] [2019-10-13 21:07:16,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:07:16,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:07:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:07:16,156 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 21 states. [2019-10-13 21:07:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:16,419 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-13 21:07:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:07:16,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 14 [2019-10-13 21:07:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:16,422 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:07:16,423 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:07:16,423 INFO L600 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-10-13 21:07:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:07:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-10-13 21:07:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 21:07:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-13 21:07:16,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-10-13 21:07:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:16,432 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-13 21:07:16,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:07:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-13 21:07:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:07:16,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:16,433 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:16,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:16,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2019-10-13 21:07:16,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:16,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604104427] [2019-10-13 21:07:16,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:16,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:16,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:07:16,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604104427] [2019-10-13 21:07:16,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:16,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:07:16,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177396806] [2019-10-13 21:07:16,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:07:16,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:07:16,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:07:16,675 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-10-13 21:07:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:16,697 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-10-13 21:07:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:07:16,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:07:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:16,702 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:07:16,702 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:07:16,702 INFO L600 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-10-13 21:07:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:07:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 21:07:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:07:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-13 21:07:16,707 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-10-13 21:07:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:16,708 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-13 21:07:16,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:07:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-13 21:07:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:07:16,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:16,712 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:16,712 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:16,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2019-10-13 21:07:16,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:16,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598163461] [2019-10-13 21:07:16,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:16,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:16,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:16,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598163461] [2019-10-13 21:07:16,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392927707] [2019-10-13 21:07:16,782 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:16,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:07:16,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:07:16,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:07:16,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:07:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:16,859 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:07:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:16,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2098959699] [2019-10-13 21:07:16,899 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:07:16,900 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:07:16,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:07:16,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-10-13 21:07:16,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263271493] [2019-10-13 21:07:16,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:07:16,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:07:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:07:16,903 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-10-13 21:07:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:16,952 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-13 21:07:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:07:16,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-10-13 21:07:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:16,955 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:07:16,956 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 21:07:16,956 INFO L600 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-10-13 21:07:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 21:07:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-13 21:07:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:07:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-13 21:07:16,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2019-10-13 21:07:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:16,966 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-13 21:07:16,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:07:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-13 21:07:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:07:16,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:16,969 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:17,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:17,175 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2019-10-13 21:07:17,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:17,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353206684] [2019-10-13 21:07:17,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:17,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:17,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:07:17,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353206684] [2019-10-13 21:07:17,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268406883] [2019-10-13 21:07:17,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:17,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:07:17,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:07:17,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:07:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:07:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:07:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:17,648 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:07:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:18,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [834943086] [2019-10-13 21:07:18,041 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:07:18,042 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:07:18,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:07:18,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2019-10-13 21:07:18,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447023040] [2019-10-13 21:07:18,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 21:07:18,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 21:07:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:07:18,044 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 30 states. [2019-10-13 21:07:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:18,654 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-10-13 21:07:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:07:18,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 22 [2019-10-13 21:07:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:18,658 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:07:18,658 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:07:18,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:07:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:07:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-10-13 21:07:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:07:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-13 21:07:18,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-10-13 21:07:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:18,669 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-13 21:07:18,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 21:07:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-13 21:07:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:07:18,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:18,671 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:18,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:18,873 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 3 times [2019-10-13 21:07:18,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:18,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826080562] [2019-10-13 21:07:18,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:18,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:18,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:18,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826080562] [2019-10-13 21:07:18,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128711255] [2019-10-13 21:07:18,952 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:18,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:07:18,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:07:18,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:07:18,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:07:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:19,061 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:07:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:19,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1418331450] [2019-10-13 21:07:19,133 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:07:19,133 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:07:19,133 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:07:19,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2019-10-13 21:07:19,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847779953] [2019-10-13 21:07:19,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:07:19,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:07:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:07:19,135 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-10-13 21:07:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:19,207 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-10-13 21:07:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:07:19,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-13 21:07:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:19,208 INFO L225 Difference]: With dead ends: 46 [2019-10-13 21:07:19,209 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:07:19,210 INFO L600 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-10-13 21:07:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:07:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-13 21:07:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:07:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-13 21:07:19,215 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2019-10-13 21:07:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:19,216 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-13 21:07:19,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:07:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-13 21:07:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:07:19,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:19,217 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:19,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:19,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 4 times [2019-10-13 21:07:19,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:19,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487998879] [2019-10-13 21:07:19,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:19,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:19,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-13 21:07:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-13 21:07:19,495 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-13 21:07:19,495 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-13 21:07:19,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:07:19 BoogieIcfgContainer [2019-10-13 21:07:19,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:07:19,525 INFO L168 Benchmark]: Toolchain (without parser) took 5438.74 ms. Allocated memory was 138.4 MB in the beginning and 246.4 MB in the end (delta: 108.0 MB). Free memory was 103.0 MB in the beginning and 148.7 MB in the end (delta: -45.7 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,525 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.67 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 93.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,528 INFO L168 Benchmark]: Boogie Preprocessor took 104.82 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 93.4 MB in the beginning and 179.6 MB in the end (delta: -86.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,528 INFO L168 Benchmark]: RCFGBuilder took 221.08 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 167.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,529 INFO L168 Benchmark]: TraceAbstraction took 4857.32 ms. Allocated memory was 200.8 MB in the beginning and 246.4 MB in the end (delta: 45.6 MB). Free memory was 167.2 MB in the beginning and 148.7 MB in the end (delta: 18.5 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:19,533 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.67 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 93.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.82 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 93.4 MB in the beginning and 179.6 MB in the end (delta: -86.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 221.08 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 167.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4857.32 ms. Allocated memory was 200.8 MB in the beginning and 246.4 MB in the end (delta: 45.6 MB). Free memory was 167.2 MB in the beginning and 148.7 MB in the end (delta: 18.5 MB). Peak memory consumption was 64.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