java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:12:30,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:12:30,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:12:30,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:12:30,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:12:30,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:12:30,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:12:30,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:12:30,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:12:30,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:12:30,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:12:30,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:12:30,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:12:30,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:12:30,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:12:30,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:12:30,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:12:30,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:12:30,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:12:30,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:12:30,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:12:30,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:12:30,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:12:30,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:12:30,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:12:30,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:12:30,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:12:30,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:12:30,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:12:30,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:12:30,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:12:30,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:12:30,067 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:12:30,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:12:30,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:12:30,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:12:30,069 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:12:30,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:12:30,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:12:30,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:12:30,086 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:12:30,086 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:12:30,086 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:12:30,087 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:12:30,087 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:12:30,087 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:12:30,087 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:12:30,087 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:12:30,088 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:12:30,088 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:12:30,088 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:12:30,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:12:30,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:12:30,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:12:30,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:12:30,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:12:30,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:12:30,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:12:30,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:12:30,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:12:30,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:12:30,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:12:30,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:12:30,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:12:30,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:12:30,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:12:30,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:12:30,094 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:12:30,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:12:30,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:12:30,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:12:30,095 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:12:30,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:12:30,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:12:30,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:12:30,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:12:30,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:12:30,167 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:12:30,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 09:12:30,229 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a94c33c5/9873e6ad6d3849ad8ea519a32e1175b5/FLAG8df16525c [2018-10-27 09:12:30,628 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:12:30,629 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 09:12:30,634 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a94c33c5/9873e6ad6d3849ad8ea519a32e1175b5/FLAG8df16525c [2018-10-27 09:12:30,647 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a94c33c5/9873e6ad6d3849ad8ea519a32e1175b5 [2018-10-27 09:12:30,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:12:30,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:12:30,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:12:30,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:12:30,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:12:30,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a8effd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30, skipping insertion in model container [2018-10-27 09:12:30,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:12:30,708 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:12:30,890 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:12:30,895 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:12:30,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:12:30,938 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:12:30,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30 WrapperNode [2018-10-27 09:12:30,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:12:30,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:12:30,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:12:30,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:12:30,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:12:30,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:12:30,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:12:30,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:12:30,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... [2018-10-27 09:12:30,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:12:30,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:12:30,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:12:30,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:12:30,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:12:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:12:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:12:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:12:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:12:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:12:31,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:12:31,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:12:31,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:12:31,588 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:12:31,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:12:31 BoogieIcfgContainer [2018-10-27 09:12:31,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:12:31,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:12:31,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:12:31,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:12:31,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:12:30" (1/3) ... [2018-10-27 09:12:31,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:12:31, skipping insertion in model container [2018-10-27 09:12:31,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:12:30" (2/3) ... [2018-10-27 09:12:31,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082fa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:12:31, skipping insertion in model container [2018-10-27 09:12:31,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:12:31" (3/3) ... [2018-10-27 09:12:31,597 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-10-27 09:12:31,607 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:12:31,615 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:12:31,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:12:31,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:12:31,664 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:12:31,665 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:12:31,665 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:12:31,665 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:12:31,665 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:12:31,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:12:31,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:12:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-27 09:12:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 09:12:31,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:31,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:31,694 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:31,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-10-27 09:12:31,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:31,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:31,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:12:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:12:31,828 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:31,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:12:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:12:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:12:31,852 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-27 09:12:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:31,888 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-27 09:12:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:12:31,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-27 09:12:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:31,901 INFO L225 Difference]: With dead ends: 83 [2018-10-27 09:12:31,902 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 09:12:31,906 INFO L605 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 [2018-10-27 09:12:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 09:12:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 09:12:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 09:12:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-10-27 09:12:31,963 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-10-27 09:12:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:31,964 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-10-27 09:12:31,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:12:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-10-27 09:12:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 09:12:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:31,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:31,966 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:31,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-10-27 09:12:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:31,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:32,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:12:32,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 09:12:32,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:32,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:12:32,270 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-10-27 09:12:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:32,948 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-10-27 09:12:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:32,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 09:12:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:32,952 INFO L225 Difference]: With dead ends: 77 [2018-10-27 09:12:32,952 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 09:12:32,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:12:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 09:12:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-10-27 09:12:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 09:12:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-10-27 09:12:32,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-10-27 09:12:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:32,980 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-10-27 09:12:32,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-10-27 09:12:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 09:12:32,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:32,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:32,983 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:32,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-10-27 09:12:32,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:32,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:32,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:33,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:12:33,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 09:12:33,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:33,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:12:33,082 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-10-27 09:12:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:33,669 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-10-27 09:12:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:33,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 09:12:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:33,675 INFO L225 Difference]: With dead ends: 121 [2018-10-27 09:12:33,677 INFO L226 Difference]: Without dead ends: 119 [2018-10-27 09:12:33,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 09:12:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-27 09:12:33,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-10-27 09:12:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 09:12:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-10-27 09:12:33,714 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-10-27 09:12:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:33,714 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-10-27 09:12:33,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-10-27 09:12:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 09:12:33,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:33,716 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:33,716 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:33,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-10-27 09:12:33,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:33,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:33,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:33,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:33,840 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:33,841 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 09:12:33,842 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-10-27 09:12:33,874 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:33,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:34,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:34,014 INFO L272 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 09:12:34,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:34,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:34,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:34,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:12:34,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:34,036 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:34,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:34,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:12:34,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16 [2018-10-27 09:12:34,843 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:12:34,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 09:12:34,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 09:12:34,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:12:34,844 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 12 states. [2018-10-27 09:12:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:36,564 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2018-10-27 09:12:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 09:12:36,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-27 09:12:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:36,570 INFO L225 Difference]: With dead ends: 245 [2018-10-27 09:12:36,570 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 09:12:36,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-10-27 09:12:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 09:12:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2018-10-27 09:12:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-27 09:12:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 323 transitions. [2018-10-27 09:12:36,626 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 323 transitions. Word has length 21 [2018-10-27 09:12:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:36,627 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 323 transitions. [2018-10-27 09:12:36,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 09:12:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 323 transitions. [2018-10-27 09:12:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 09:12:36,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:36,629 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:36,629 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:36,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-10-27 09:12:36,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:36,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:36,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:36,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:36,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 09:12:36,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:36,745 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:36,746 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 09:12:36,746 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-10-27 09:12:36,748 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:36,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:36,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:36,790 INFO L272 AbstractInterpreter]: Visited 24 different actions 34 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 09:12:36,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:36,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:36,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:36,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:36,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:36,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:36,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:37,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:37,046 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:37,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-10-27 09:12:37,047 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:37,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 09:12:37,048 INFO L87 Difference]: Start difference. First operand 202 states and 323 transitions. Second operand 6 states. [2018-10-27 09:12:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:37,431 INFO L93 Difference]: Finished difference Result 274 states and 432 transitions. [2018-10-27 09:12:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:37,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 09:12:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:37,436 INFO L225 Difference]: With dead ends: 274 [2018-10-27 09:12:37,436 INFO L226 Difference]: Without dead ends: 272 [2018-10-27 09:12:37,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:12:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-27 09:12:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 235. [2018-10-27 09:12:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-27 09:12:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2018-10-27 09:12:37,486 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 28 [2018-10-27 09:12:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:37,486 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2018-10-27 09:12:37,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2018-10-27 09:12:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 09:12:37,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:37,490 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:37,490 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:37,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-10-27 09:12:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:37,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:37,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:37,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:37,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:37,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-27 09:12:37,597 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105] [2018-10-27 09:12:37,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:37,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:37,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:37,633 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 09:12:37,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:37,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:37,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:37,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:37,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:37,655 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:37,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:37,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-10-27 09:12:38,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:38,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 09:12:38,071 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand 6 states. [2018-10-27 09:12:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:38,589 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2018-10-27 09:12:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:12:38,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 09:12:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:38,593 INFO L225 Difference]: With dead ends: 317 [2018-10-27 09:12:38,593 INFO L226 Difference]: Without dead ends: 315 [2018-10-27 09:12:38,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:12:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-27 09:12:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2018-10-27 09:12:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-27 09:12:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 463 transitions. [2018-10-27 09:12:38,643 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 463 transitions. Word has length 31 [2018-10-27 09:12:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:38,643 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 463 transitions. [2018-10-27 09:12:38,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 463 transitions. [2018-10-27 09:12:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 09:12:38,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:38,646 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:38,646 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:38,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:38,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-10-27 09:12:38,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:38,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:38,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:38,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:38,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:38,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:38,998 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:38,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-27 09:12:38,999 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-10-27 09:12:39,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:39,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:39,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:39,068 INFO L272 AbstractInterpreter]: Visited 26 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 09:12:39,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:39,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:39,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:39,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:39,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:39,100 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:39,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:39,357 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-10-27 09:12:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:39,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:39,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:12:39,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-10-27 09:12:39,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:12:39,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 09:12:39,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 09:12:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-27 09:12:39,683 INFO L87 Difference]: Start difference. First operand 288 states and 463 transitions. Second operand 14 states. [2018-10-27 09:12:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:41,380 INFO L93 Difference]: Finished difference Result 382 states and 598 transitions. [2018-10-27 09:12:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 09:12:41,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-27 09:12:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:41,385 INFO L225 Difference]: With dead ends: 382 [2018-10-27 09:12:41,385 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 09:12:41,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:12:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 09:12:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 337. [2018-10-27 09:12:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 09:12:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 531 transitions. [2018-10-27 09:12:41,430 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 531 transitions. Word has length 33 [2018-10-27 09:12:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:41,430 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 531 transitions. [2018-10-27 09:12:41,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 09:12:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 531 transitions. [2018-10-27 09:12:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:12:41,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:41,432 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:41,432 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1831965438, now seen corresponding path program 1 times [2018-10-27 09:12:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:41,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 09:12:41,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:41,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:41,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 09:12:41,551 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [36], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [119], [120], [121], [122] [2018-10-27 09:12:41,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:41,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:41,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:41,601 INFO L272 AbstractInterpreter]: Visited 25 different actions 35 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-10-27 09:12:41,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:41,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:41,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:41,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:41,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:41,661 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:41,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:41,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-10-27 09:12:41,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:41,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:12:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:12:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:12:41,861 INFO L87 Difference]: Start difference. First operand 337 states and 531 transitions. Second operand 7 states. [2018-10-27 09:12:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:42,178 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2018-10-27 09:12:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:42,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-27 09:12:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:42,183 INFO L225 Difference]: With dead ends: 351 [2018-10-27 09:12:42,183 INFO L226 Difference]: Without dead ends: 349 [2018-10-27 09:12:42,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:12:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-27 09:12:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-10-27 09:12:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-27 09:12:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2018-10-27 09:12:42,222 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 32 [2018-10-27 09:12:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:42,223 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2018-10-27 09:12:42,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:12:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2018-10-27 09:12:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 09:12:42,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:42,224 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:42,225 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:42,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-10-27 09:12:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:42,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:42,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:42,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:42,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:12:42,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:42,334 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:42,335 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-27 09:12:42,335 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-10-27 09:12:42,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:42,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:42,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:42,359 INFO L272 AbstractInterpreter]: Visited 26 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 09:12:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:42,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:42,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:42,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:42,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:42,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:42,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:42,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 09:12:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:42,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-10-27 09:12:42,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:42,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:12:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:12:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-10-27 09:12:42,774 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand 8 states. [2018-10-27 09:12:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:43,411 INFO L93 Difference]: Finished difference Result 564 states and 907 transitions. [2018-10-27 09:12:43,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:12:43,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-27 09:12:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:43,416 INFO L225 Difference]: With dead ends: 564 [2018-10-27 09:12:43,417 INFO L226 Difference]: Without dead ends: 562 [2018-10-27 09:12:43,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-10-27 09:12:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-27 09:12:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 533. [2018-10-27 09:12:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-27 09:12:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2018-10-27 09:12:43,497 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 33 [2018-10-27 09:12:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:43,497 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2018-10-27 09:12:43,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:12:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2018-10-27 09:12:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 09:12:43,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:43,499 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:43,499 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:43,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-10-27 09:12:43,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:43,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 09:12:43,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:43,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:43,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-27 09:12:43,866 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-10-27 09:12:43,867 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:43,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:43,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:43,896 INFO L272 AbstractInterpreter]: Visited 30 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 09:12:43,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:43,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:43,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:43,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:43,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:43,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:43,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 09:12:44,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 09:12:44,209 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:44,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-10-27 09:12:44,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:44,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:12:44,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:12:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:12:44,210 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand 7 states. [2018-10-27 09:12:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:44,896 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2018-10-27 09:12:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:12:44,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-27 09:12:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:44,910 INFO L225 Difference]: With dead ends: 609 [2018-10-27 09:12:44,910 INFO L226 Difference]: Without dead ends: 607 [2018-10-27 09:12:44,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:12:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-27 09:12:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2018-10-27 09:12:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-10-27 09:12:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2018-10-27 09:12:44,987 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 43 [2018-10-27 09:12:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:44,987 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2018-10-27 09:12:44,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:12:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2018-10-27 09:12:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 09:12:44,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:44,989 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:44,989 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:44,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 351208904, now seen corresponding path program 1 times [2018-10-27 09:12:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:44,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:44,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 09:12:45,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:45,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:45,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-27 09:12:45,602 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [49], [53], [58], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [119], [120], [121], [122] [2018-10-27 09:12:45,603 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:45,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:45,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:45,629 INFO L272 AbstractInterpreter]: Visited 31 different actions 51 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 09:12:45,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:45,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:45,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:45,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:45,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:45,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:45,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 09:12:46,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 09:12:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:12:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-10-27 09:12:46,197 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:46,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:12:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:12:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:12:46,198 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand 7 states. [2018-10-27 09:12:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:46,503 INFO L93 Difference]: Finished difference Result 610 states and 982 transitions. [2018-10-27 09:12:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:12:46,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-27 09:12:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:46,508 INFO L225 Difference]: With dead ends: 610 [2018-10-27 09:12:46,508 INFO L226 Difference]: Without dead ends: 608 [2018-10-27 09:12:46,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:12:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-27 09:12:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 541. [2018-10-27 09:12:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-10-27 09:12:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 869 transitions. [2018-10-27 09:12:46,607 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 869 transitions. Word has length 44 [2018-10-27 09:12:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:46,607 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 869 transitions. [2018-10-27 09:12:46,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:12:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 869 transitions. [2018-10-27 09:12:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 09:12:46,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:46,610 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:46,610 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:46,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 506108398, now seen corresponding path program 1 times [2018-10-27 09:12:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:46,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-27 09:12:47,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:47,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:47,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-10-27 09:12:47,114 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-10-27 09:12:47,116 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:47,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:47,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:47,175 INFO L272 AbstractInterpreter]: Visited 32 different actions 57 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-10-27 09:12:47,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:47,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:47,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:47,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:47,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:47,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 09:12:47,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-27 09:12:47,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 09:12:47,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2018-10-27 09:12:47,751 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:12:47,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:12:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:12:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:12:47,752 INFO L87 Difference]: Start difference. First operand 541 states and 869 transitions. Second operand 6 states. [2018-10-27 09:12:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:48,277 INFO L93 Difference]: Finished difference Result 1026 states and 1618 transitions. [2018-10-27 09:12:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:12:48,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-10-27 09:12:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:48,284 INFO L225 Difference]: With dead ends: 1026 [2018-10-27 09:12:48,284 INFO L226 Difference]: Without dead ends: 550 [2018-10-27 09:12:48,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:12:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-27 09:12:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 490. [2018-10-27 09:12:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-27 09:12:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 770 transitions. [2018-10-27 09:12:48,384 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 770 transitions. Word has length 64 [2018-10-27 09:12:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:48,385 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 770 transitions. [2018-10-27 09:12:48,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:12:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 770 transitions. [2018-10-27 09:12:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 09:12:48,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:48,389 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:48,389 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -541127611, now seen corresponding path program 1 times [2018-10-27 09:12:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:48,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 27 proven. 51 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-27 09:12:48,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:48,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:48,777 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-10-27 09:12:48,778 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [49], [53], [58], [63], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120], [121], [122] [2018-10-27 09:12:48,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:12:48,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:12:48,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:12:48,812 INFO L272 AbstractInterpreter]: Visited 39 different actions 74 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 15 variables. [2018-10-27 09:12:48,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:48,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:12:48,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:48,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:12:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:12:48,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:12:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:48,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 09:12:49,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-27 09:12:49,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:12:49,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2018-10-27 09:12:49,751 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:12:49,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 09:12:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 09:12:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=325, Unknown=1, NotChecked=0, Total=380 [2018-10-27 09:12:49,754 INFO L87 Difference]: Start difference. First operand 490 states and 770 transitions. Second operand 14 states. [2018-10-27 09:13:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:03,276 INFO L93 Difference]: Finished difference Result 1382 states and 2209 transitions. [2018-10-27 09:13:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 09:13:03,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-10-27 09:13:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:03,280 INFO L225 Difference]: With dead ends: 1382 [2018-10-27 09:13:03,280 INFO L226 Difference]: Without dead ends: 391 [2018-10-27 09:13:03,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=510, Invalid=2141, Unknown=1, NotChecked=0, Total=2652 [2018-10-27 09:13:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-27 09:13:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 251. [2018-10-27 09:13:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-27 09:13:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 365 transitions. [2018-10-27 09:13:03,335 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 365 transitions. Word has length 80 [2018-10-27 09:13:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:03,337 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 365 transitions. [2018-10-27 09:13:03,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 09:13:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 365 transitions. [2018-10-27 09:13:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 09:13:03,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:13:03,339 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:13:03,339 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:13:03,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 1 times [2018-10-27 09:13:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:13:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:03,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:03,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:13:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-27 09:13:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:03,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:13:03,776 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-10-27 09:13:03,776 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-10-27 09:13:03,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:13:03,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:13:03,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:13:03,855 INFO L272 AbstractInterpreter]: Visited 43 different actions 133 times. Merged at 9 different actions 9 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 09:13:03,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:03,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:13:03,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:03,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:13:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:03,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:13:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:03,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-27 09:13:04,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-27 09:13:04,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:04,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2018-10-27 09:13:04,357 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:04,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:13:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:13:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-10-27 09:13:04,358 INFO L87 Difference]: Start difference. First operand 251 states and 365 transitions. Second operand 16 states. [2018-10-27 09:13:07,430 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 09:13:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:10,753 INFO L93 Difference]: Finished difference Result 351 states and 501 transitions. [2018-10-27 09:13:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 09:13:10,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-10-27 09:13:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:10,755 INFO L225 Difference]: With dead ends: 351 [2018-10-27 09:13:10,755 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 09:13:10,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=607, Invalid=2149, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 09:13:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 09:13:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 09:13:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 09:13:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 09:13:10,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-10-27 09:13:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:10,760 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 09:13:10,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:13:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 09:13:10,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 09:13:10,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 09:13:10,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:10,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:10,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:10,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:10,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,378 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 148 [2018-10-27 09:13:11,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,784 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 155 [2018-10-27 09:13:11,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:11,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,221 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 107 [2018-10-27 09:13:12,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,391 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 143 [2018-10-27 09:13:12,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 09:13:12,579 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 123 [2018-10-27 09:13:14,311 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2018-10-27 09:13:15,425 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 147 DAG size of output: 35 [2018-10-27 09:13:15,673 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 20 [2018-10-27 09:13:16,807 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 153 DAG size of output: 33 [2018-10-27 09:13:16,959 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 19 [2018-10-27 09:13:17,081 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 19 [2018-10-27 09:13:17,254 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2018-10-27 09:13:17,394 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2018-10-27 09:13:17,566 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 20 [2018-10-27 09:13:17,881 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 18 [2018-10-27 09:13:18,051 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2018-10-27 09:13:19,310 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 97 DAG size of output: 22 [2018-10-27 09:13:20,540 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 141 DAG size of output: 18 [2018-10-27 09:13:20,977 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 22 [2018-10-27 09:13:28,663 WARN L179 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 102 DAG size of output: 28 [2018-10-27 09:13:28,667 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 09:13:28,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:13:28,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 09:13:28,667 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 09:13:28,667 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 09:13:28,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 09:13:28,668 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,668 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-10-27 09:13:28,668 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~i~0) (<= 1 main_~l~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,668 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,668 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-10-27 09:13:28,668 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse0 (<= 1 main_~l~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse3 (<= 2 main_~r~0))) (or (and (<= 2 main_~j~0) .cse0 .cse1 (<= main_~i~0 main_~n~0) .cse2 (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) .cse3) (and .cse0 .cse1 .cse2 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 (<= (+ main_~r~0 1) main_~n~0)))) [2018-10-27 09:13:28,668 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-10-27 09:13:28,668 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-10-27 09:13:28,668 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,669 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,669 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-10-27 09:13:28,669 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,669 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,669 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse4 (<= 2 main_~l~0)) (.cse2 (<= 2 main_~j~0)) (.cse3 (and (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 2 main_~r~0)))) (let ((.cse0 (and .cse4 (and .cse2 .cse3))) (.cse1 (<= main_~r~0 main_~n~0))) (or (and .cse0 (<= main_~i~0 main_~n~0) .cse1) (and .cse0 .cse1 (<= main_~j~0 (* 2 main_~l~0))) (and .cse2 .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 (<= (+ main_~r~0 1) main_~n~0)) (and .cse0 .cse1 (<= main_~j~0 main_~n~0))))) [2018-10-27 09:13:28,670 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-27 09:13:28,670 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse3 (<= 2 main_~l~0)) (.cse1 (<= 2 main_~j~0)) (.cse2 (and (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 1 main_~n~0) (<= 2 main_~r~0)))) (let ((.cse0 (and .cse3 (and .cse1 (<= main_~r~0 main_~n~0) .cse2)))) (or (and .cse0 (<= main_~i~0 main_~n~0)) (and (and .cse1 .cse2 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0)) .cse3) (and .cse0 (<= main_~j~0 (* 2 main_~l~0))) (and .cse0 (<= main_~j~0 main_~n~0))))) [2018-10-27 09:13:28,670 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-10-27 09:13:28,670 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,670 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,670 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-27 09:13:28,670 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-27 09:13:28,671 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-10-27 09:13:28,671 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,671 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,671 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-27 09:13:28,671 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-27 09:13:28,671 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~i~0) (<= 1 main_~l~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-10-27 09:13:28,671 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-27 09:13:28,672 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-27 09:13:28,672 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-27 09:13:28,672 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-27 09:13:28,672 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-27 09:13:28,672 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-27 09:13:28,672 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-27 09:13:28,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:13:28 BoogieIcfgContainer [2018-10-27 09:13:28,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:13:28,692 INFO L168 Benchmark]: Toolchain (without parser) took 58030.34 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 841.5 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:28,693 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:13:28,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:28,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:13:28,694 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:13:28,695 INFO L168 Benchmark]: RCFGBuilder took 601.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:28,696 INFO L168 Benchmark]: TraceAbstraction took 57100.87 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -346.5 MB). Peak memory consumption was 868.0 MB. Max. memory is 7.1 GB. [2018-10-27 09:13:28,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 22.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 601.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57100.87 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -346.5 MB). Peak memory consumption was 868.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-10-27 09:13:28,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 09:13:28,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((2 <= j && 1 <= l) && 1 <= i) && i <= n) && l <= n / 2 + 1) && l + 1 <= n) && r <= n) && 2 <= r) || (((((1 <= l && 1 <= i) && l <= n / 2 + 1) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) && r + 1 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 57.0s OverallTime, 14 OverallIterations, 14 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 17.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 919 SDtfs, 911 SDslu, 3378 SDs, 0 SdLazy, 4879 SolverSat, 1609 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 978 SyntacticMatches, 26 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 538 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 885 PreInvPairs, 1299 NumberOfFragments, 720 HoareAnnotationTreeSize, 885 FomulaSimplifications, 28665800 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2224983 FormulaSimplificationTreeSizeReductionInter, 15.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1511 ConstructedInterpolants, 94 QuantifiedInterpolants, 267265 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 2357/2577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...